./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/reducercommutativity/sep.i -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 e150e83dea41703782a488455769a24bf6c8f600 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/reducercommutativity/sep.i -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 e150e83dea41703782a488455769a24bf6c8f600 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:22:37,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:22:37,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:22:37,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:22:37,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:22:37,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:22:37,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:22:37,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:22:37,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:22:37,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:22:37,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:22:37,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:22:37,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:22:37,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:22:37,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:22:37,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:22:37,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:22:37,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:22:37,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:22:37,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:22:37,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:22:37,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:22:37,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:22:37,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:22:37,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:22:37,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:22:37,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:22:37,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:22:37,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:22:37,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:22:37,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:22:37,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:22:37,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:22:37,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:22:37,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:22:37,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:22:37,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:22:37,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:22:37,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:22:37,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:22:37,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:22:37,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:22:37,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:22:37,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:22:37,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:22:37,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:22:37,610 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:22:37,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:22:37,610 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:22:37,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:22:37,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:22:37,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:22:37,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:22:37,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:22:37,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:22:37,612 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:22:37,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:22:37,613 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:22:37,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:22:37,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:22:37,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:22:37,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:22:37,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:22:37,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:22:37,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:22:37,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:22:37,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:22:37,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:22:37,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:22:37,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:22:37,617 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:22:37,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> e150e83dea41703782a488455769a24bf6c8f600 [2019-11-28 15:22:37,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:22:37,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:22:37,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:22:37,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:22:37,952 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:22:37,954 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2019-11-28 15:22:38,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f52f7516/87aea9494399420da26377a162c44078/FLAG666bb95ec [2019-11-28 15:22:38,426 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:22:38,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2019-11-28 15:22:38,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f52f7516/87aea9494399420da26377a162c44078/FLAG666bb95ec [2019-11-28 15:22:38,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f52f7516/87aea9494399420da26377a162c44078 [2019-11-28 15:22:38,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:22:38,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:22:38,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:22:38,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:22:38,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:22:38,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:22:38" (1/1) ... [2019-11-28 15:22:38,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388be10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:38, skipping insertion in model container [2019-11-28 15:22:38,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:22:38" (1/1) ... [2019-11-28 15:22:38,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:22:38,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:22:39,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:22:39,033 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:22:39,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:22:39,067 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:22:39,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39 WrapperNode [2019-11-28 15:22:39,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:22:39,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:22:39,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:22:39,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:22:39,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:22:39,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:22:39,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:22:39,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:22:39,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (1/1) ... [2019-11-28 15:22:39,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:22:39,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:22:39,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:22:39,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:22:39,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (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 [2019-11-28 15:22:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 15:22:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:22:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:22:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 15:22:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 15:22:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 15:22:39,624 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:22:39,625 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 15:22:39,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:39 BoogieIcfgContainer [2019-11-28 15:22:39,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:22:39,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:22:39,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:22:39,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:22:39,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:22:38" (1/3) ... [2019-11-28 15:22:39,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4c56c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:22:39, skipping insertion in model container [2019-11-28 15:22:39,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:39" (2/3) ... [2019-11-28 15:22:39,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4c56c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:22:39, skipping insertion in model container [2019-11-28 15:22:39,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:39" (3/3) ... [2019-11-28 15:22:39,649 INFO L109 eAbstractionObserver]: Analyzing ICFG sep.i [2019-11-28 15:22:39,670 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:22:39,679 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:22:39,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:22:39,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:22:39,723 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:22:39,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:22:39,723 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:22:39,723 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:22:39,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:22:39,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:22:39,724 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:22:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-28 15:22:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:22:39,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:22:39,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:22:39,744 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:22:39,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:22:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash -805411982, now seen corresponding path program 1 times [2019-11-28 15:22:39,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:22:39,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620209407] [2019-11-28 15:22:39,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:22:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:22:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:22:39,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620209407] [2019-11-28 15:22:39,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:22:39,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:22:39,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615580527] [2019-11-28 15:22:39,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 15:22:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:22:39,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 15:22:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:22:39,934 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-28 15:22:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:22:39,965 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-28 15:22:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 15:22:39,969 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 15:22:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:22:39,983 INFO L225 Difference]: With dead ends: 52 [2019-11-28 15:22:39,983 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 15:22:39,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:22:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 15:22:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 15:22:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 15:22:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-28 15:22:40,052 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2019-11-28 15:22:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:22:40,054 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 15:22:40,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 15:22:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-28 15:22:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:22:40,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:22:40,056 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:22:40,058 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:22:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:22:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1872946201, now seen corresponding path program 1 times [2019-11-28 15:22:40,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:22:40,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054425376] [2019-11-28 15:22:40,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:22:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:22:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:22:40,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054425376] [2019-11-28 15:22:40,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:22:40,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:22:40,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279283759] [2019-11-28 15:22:40,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:22:40,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:22:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:22:40,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:22:40,238 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 3 states. [2019-11-28 15:22:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:22:40,323 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2019-11-28 15:22:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:22:40,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:22:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:22:40,325 INFO L225 Difference]: With dead ends: 45 [2019-11-28 15:22:40,327 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 15:22:40,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:22:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 15:22:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-28 15:22:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 15:22:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-28 15:22:40,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2019-11-28 15:22:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:22:40,340 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-28 15:22:40,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:22:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-11-28 15:22:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:22:40,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:22:40,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:22:40,342 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:22:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:22:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash -567209286, now seen corresponding path program 1 times [2019-11-28 15:22:40,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:22:40,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217929826] [2019-11-28 15:22:40,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:22:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:22:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:22:40,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217929826] [2019-11-28 15:22:40,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:22:40,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:22:40,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692413410] [2019-11-28 15:22:40,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:22:40,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:22:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:22:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:22:40,456 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 4 states. [2019-11-28 15:22:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:22:40,543 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-11-28 15:22:40,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:22:40,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 15:22:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:22:40,546 INFO L225 Difference]: With dead ends: 46 [2019-11-28 15:22:40,546 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 15:22:40,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:22:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 15:22:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-28 15:22:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 15:22:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-28 15:22:40,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 19 [2019-11-28 15:22:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:22:40,560 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 15:22:40,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:22:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-11-28 15:22:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:22:40,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:22:40,563 INFO L410 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] [2019-11-28 15:22:40,563 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:22:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:22:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2050984225, now seen corresponding path program 1 times [2019-11-28 15:22:40,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:22:40,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615352131] [2019-11-28 15:22:40,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:22:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:22:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:22:40,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615352131] [2019-11-28 15:22:40,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:22:40,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:22:40,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481867931] [2019-11-28 15:22:40,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:22:40,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:22:40,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:22:40,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:22:40,713 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2019-11-28 15:22:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:22:40,756 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-11-28 15:22:40,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:22:40,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-28 15:22:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:22:40,758 INFO L225 Difference]: With dead ends: 39 [2019-11-28 15:22:40,758 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 15:22:40,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:22:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 15:22:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-28 15:22:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 15:22:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-28 15:22:40,765 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2019-11-28 15:22:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:22:40,765 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-28 15:22:40,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:22:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-28 15:22:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:22:40,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:22:40,767 INFO L410 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] [2019-11-28 15:22:40,767 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:22:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:22:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1500824769, now seen corresponding path program 1 times [2019-11-28 15:22:40,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:22:40,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92092038] [2019-11-28 15:22:40,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:22:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:22:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:22:40,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92092038] [2019-11-28 15:22:40,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340421167] [2019-11-28 15:22:40,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:22:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:22:40,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:22:40,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:22:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:22:41,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:22:41,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 15:22:41,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804603791] [2019-11-28 15:22:41,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:22:41,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:22:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:22:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:22:41,005 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 6 states. [2019-11-28 15:22:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:22:41,074 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2019-11-28 15:22:41,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:22:41,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-28 15:22:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:22:41,076 INFO L225 Difference]: With dead ends: 54 [2019-11-28 15:22:41,076 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 15:22:41,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:22:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 15:22:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-28 15:22:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 15:22:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-28 15:22:41,083 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 27 [2019-11-28 15:22:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:22:41,084 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-28 15:22:41,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:22:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-28 15:22:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 15:22:41,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:22:41,086 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:22:41,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:22:41,292 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:22:41,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:22:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1175870478, now seen corresponding path program 2 times [2019-11-28 15:22:41,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:22:41,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995107644] [2019-11-28 15:22:41,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:22:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:22:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 15:22:41,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995107644] [2019-11-28 15:22:41,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051997489] [2019-11-28 15:22:41,443 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:22:41,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:22:41,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:22:41,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:22:41,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:22:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 15:22:41,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:22:41,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 15:22:41,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695560485] [2019-11-28 15:22:41,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:22:41,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:22:41,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:22:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:22:41,571 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 7 states. [2019-11-28 15:22:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:22:41,688 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2019-11-28 15:22:41,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:22:41,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-28 15:22:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:22:41,690 INFO L225 Difference]: With dead ends: 58 [2019-11-28 15:22:41,690 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 15:22:41,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:22:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 15:22:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-11-28 15:22:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 15:22:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2019-11-28 15:22:41,706 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 30 [2019-11-28 15:22:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:22:41,706 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-11-28 15:22:41,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:22:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2019-11-28 15:22:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:22:41,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:22:41,714 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:22:41,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:22:41,926 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:22:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:22:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash 657704709, now seen corresponding path program 3 times [2019-11-28 15:22:41,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:22:41,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376702713] [2019-11-28 15:22:41,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:22:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:22:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:22:42,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376702713] [2019-11-28 15:22:42,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474659397] [2019-11-28 15:22:42,750 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:22:42,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 15:22:42,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:22:42,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 15:22:42,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:22:42,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:22:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:22:43,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:23:00,537 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-28 15:23:00,539 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-11-28 15:23:00,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:23:00,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-11-28 15:23:00,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638869920] [2019-11-28 15:23:00,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 15:23:00,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:23:00,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 15:23:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-28 15:23:00,541 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 16 states. [2019-11-28 15:23:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 15:23:00,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:23:00,745 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@476b9e0c at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 15:23:00,753 INFO L168 Benchmark]: Toolchain (without parser) took 21956.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.3 MB in the beginning and 848.1 MB in the end (delta: 108.3 MB). Peak memory consumption was 250.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:00,754 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:23:00,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.04 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:00,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:00,757 INFO L168 Benchmark]: Boogie Preprocessor took 48.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:23:00,757 INFO L168 Benchmark]: RCFGBuilder took 413.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:00,758 INFO L168 Benchmark]: TraceAbstraction took 21121.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 848.1 MB in the end (delta: 259.1 MB). Peak memory consumption was 259.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:00,766 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.04 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 413.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21121.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 848.1 MB in the end (delta: 259.1 MB). Peak memory consumption was 259.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@476b9e0c de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@476b9e0c: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 15:23:02,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:23:02,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:23:02,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:23:02,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:23:02,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:23:02,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:23:02,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:23:02,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:23:02,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:23:02,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:23:02,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:23:02,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:23:02,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:23:02,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:23:02,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:23:02,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:23:02,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:23:02,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:23:02,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:23:02,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:23:02,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:23:02,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:23:02,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:23:02,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:23:02,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:23:02,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:23:02,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:23:02,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:23:02,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:23:02,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:23:02,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:23:02,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:23:02,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:23:02,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:23:02,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:23:02,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:23:02,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:23:02,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:23:02,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:23:02,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:23:02,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 15:23:02,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:23:02,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:23:02,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:23:02,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:23:02,730 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:23:02,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:23:02,731 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:23:02,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:23:02,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:23:02,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:23:02,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:23:02,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:23:02,733 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 15:23:02,733 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 15:23:02,733 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:23:02,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:23:02,734 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:23:02,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:23:02,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:23:02,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:23:02,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:23:02,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:23:02,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:23:02,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:23:02,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:23:02,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:23:02,737 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 15:23:02,737 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 15:23:02,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:23:02,737 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:23:02,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 15:23:02,738 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> e150e83dea41703782a488455769a24bf6c8f600 [2019-11-28 15:23:03,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:23:03,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:23:03,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:23:03,071 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:23:03,071 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:23:03,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2019-11-28 15:23:03,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed15e707/040b0a2b306d4486bee922fa49c29ad6/FLAG30c2c680d [2019-11-28 15:23:03,573 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:23:03,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2019-11-28 15:23:03,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed15e707/040b0a2b306d4486bee922fa49c29ad6/FLAG30c2c680d [2019-11-28 15:23:03,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed15e707/040b0a2b306d4486bee922fa49c29ad6 [2019-11-28 15:23:03,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:23:03,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:23:03,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:23:03,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:23:03,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:23:03,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:23:03" (1/1) ... [2019-11-28 15:23:03,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cffb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:03, skipping insertion in model container [2019-11-28 15:23:03,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:23:03" (1/1) ... [2019-11-28 15:23:04,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:23:04,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:23:04,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:23:04,284 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:23:04,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:23:04,338 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:23:04,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04 WrapperNode [2019-11-28 15:23:04,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:23:04,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:23:04,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:23:04,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:23:04,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:23:04,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:23:04,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:23:04,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:23:04,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (1/1) ... [2019-11-28 15:23:04,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:23:04,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:23:04,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:23:04,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:23:04,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (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 [2019-11-28 15:23:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 15:23:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:23:04,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:23:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 15:23:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 15:23:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 15:23:04,958 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:23:04,958 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 15:23:04,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:23:04 BoogieIcfgContainer [2019-11-28 15:23:04,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:23:04,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:23:04,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:23:04,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:23:04,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:23:03" (1/3) ... [2019-11-28 15:23:04,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd27539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:23:04, skipping insertion in model container [2019-11-28 15:23:04,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:23:04" (2/3) ... [2019-11-28 15:23:04,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd27539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:23:04, skipping insertion in model container [2019-11-28 15:23:04,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:23:04" (3/3) ... [2019-11-28 15:23:04,966 INFO L109 eAbstractionObserver]: Analyzing ICFG sep.i [2019-11-28 15:23:04,974 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:23:04,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:23:04,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:23:05,015 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:23:05,015 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:23:05,015 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:23:05,015 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:23:05,016 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:23:05,016 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:23:05,016 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:23:05,016 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:23:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-28 15:23:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:23:05,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:05,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:05,038 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -805411982, now seen corresponding path program 1 times [2019-11-28 15:23:05,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:05,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366564200] [2019-11-28 15:23:05,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 15:23:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:23:05,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 15:23:05,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:23:05,157 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:23:05,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366564200] [2019-11-28 15:23:05,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:23:05,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 15:23:05,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125041613] [2019-11-28 15:23:05,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 15:23:05,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:23:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 15:23:05,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:23:05,188 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-28 15:23:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:23:05,210 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-28 15:23:05,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 15:23:05,211 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 15:23:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:23:05,221 INFO L225 Difference]: With dead ends: 52 [2019-11-28 15:23:05,222 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 15:23:05,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:23:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 15:23:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 15:23:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 15:23:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-28 15:23:05,254 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2019-11-28 15:23:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:23:05,254 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 15:23:05,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 15:23:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-28 15:23:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:23:05,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:05,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:05,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 15:23:05,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:05,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:05,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1872946201, now seen corresponding path program 1 times [2019-11-28 15:23:05,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:05,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480859627] [2019-11-28 15:23:05,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 15:23:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:23:05,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 15:23:05,545 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:23:05,727 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:23:05,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480859627] [2019-11-28 15:23:05,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:23:05,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 15 [2019-11-28 15:23:05,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181948465] [2019-11-28 15:23:05,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 15:23:05,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:23:05,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 15:23:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 15:23:05,900 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 15 states. [2019-11-28 15:23:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:23:06,332 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2019-11-28 15:23:06,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 15:23:06,332 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-11-28 15:23:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:23:06,336 INFO L225 Difference]: With dead ends: 64 [2019-11-28 15:23:06,336 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 15:23:06,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-11-28 15:23:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 15:23:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2019-11-28 15:23:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 15:23:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-11-28 15:23:06,349 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 16 [2019-11-28 15:23:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:23:06,349 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-28 15:23:06,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 15:23:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2019-11-28 15:23:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:23:06,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:06,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:06,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 15:23:06,556 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash -528068644, now seen corresponding path program 1 times [2019-11-28 15:23:06,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:06,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416133547] [2019-11-28 15:23:06,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 15:23:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:23:06,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:23:06,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:23:06,658 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:23:06,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416133547] [2019-11-28 15:23:06,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:23:06,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 15:23:06,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238185898] [2019-11-28 15:23:06,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:23:06,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:23:06,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:23:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:23:06,679 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 4 states. [2019-11-28 15:23:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:23:06,752 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-11-28 15:23:06,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:23:06,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 15:23:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:23:06,754 INFO L225 Difference]: With dead ends: 55 [2019-11-28 15:23:06,754 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 15:23:06,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:23:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 15:23:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 15:23:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 15:23:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 15:23:06,760 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2019-11-28 15:23:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:23:06,760 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 15:23:06,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:23:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-28 15:23:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:23:06,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:06,762 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:06,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 15:23:06,973 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash -877574393, now seen corresponding path program 1 times [2019-11-28 15:23:06,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:06,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284484402] [2019-11-28 15:23:06,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 15:23:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:23:07,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 15:23:07,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:23:07,125 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:23:07,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284484402] [2019-11-28 15:23:07,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:23:07,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-28 15:23:07,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282363487] [2019-11-28 15:23:07,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 15:23:07,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:23:07,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 15:23:07,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-11-28 15:23:07,270 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 12 states. [2019-11-28 15:23:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:23:07,588 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2019-11-28 15:23:07,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 15:23:07,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-28 15:23:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:23:07,591 INFO L225 Difference]: With dead ends: 77 [2019-11-28 15:23:07,591 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 15:23:07,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-11-28 15:23:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 15:23:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-11-28 15:23:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 15:23:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-11-28 15:23:07,613 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 22 [2019-11-28 15:23:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:23:07,614 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-11-28 15:23:07,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 15:23:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-11-28 15:23:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:23:07,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:07,617 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:07,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 15:23:07,829 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1474637889, now seen corresponding path program 1 times [2019-11-28 15:23:07,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:07,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315980192] [2019-11-28 15:23:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 15:23:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:23:07,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 15:23:07,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:23:08,038 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:23:08,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315980192] [2019-11-28 15:23:08,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:23:08,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-28 15:23:08,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130255048] [2019-11-28 15:23:08,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 15:23:08,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:23:08,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 15:23:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-28 15:23:08,297 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 16 states. [2019-11-28 15:23:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:23:08,928 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2019-11-28 15:23:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 15:23:08,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-28 15:23:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:23:08,930 INFO L225 Difference]: With dead ends: 140 [2019-11-28 15:23:08,930 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 15:23:08,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-11-28 15:23:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 15:23:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2019-11-28 15:23:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 15:23:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-11-28 15:23:08,948 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 31 [2019-11-28 15:23:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:23:08,948 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-11-28 15:23:08,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 15:23:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-11-28 15:23:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 15:23:08,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:08,950 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:09,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 15:23:09,159 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:09,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2038223641, now seen corresponding path program 2 times [2019-11-28 15:23:09,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:09,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016572507] [2019-11-28 15:23:09,161 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-28 15:23:09,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 15:23:09,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:23:09,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:23:09,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:23:09,243 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:23:09,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016572507] [2019-11-28 15:23:09,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:23:09,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 15:23:09,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935807649] [2019-11-28 15:23:09,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:23:09,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:23:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:23:09,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:23:09,278 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 6 states. [2019-11-28 15:23:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:23:09,400 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2019-11-28 15:23:09,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:23:09,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 15:23:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:23:09,402 INFO L225 Difference]: With dead ends: 128 [2019-11-28 15:23:09,402 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 15:23:09,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:23:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 15:23:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-11-28 15:23:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 15:23:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-11-28 15:23:09,414 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 34 [2019-11-28 15:23:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:23:09,415 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-11-28 15:23:09,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:23:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-11-28 15:23:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:23:09,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:09,417 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:09,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 15:23:09,627 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash 657704709, now seen corresponding path program 1 times [2019-11-28 15:23:09,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:09,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776449384] [2019-11-28 15:23:09,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 15:23:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:23:09,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 15:23:09,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:23:09,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:23:10,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776449384] [2019-11-28 15:23:10,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:23:10,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-11-28 15:23:10,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638497698] [2019-11-28 15:23:10,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 15:23:10,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:23:10,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 15:23:10,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-11-28 15:23:10,528 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand 27 states. [2019-11-28 15:23:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:23:11,631 INFO L93 Difference]: Finished difference Result 457 states and 585 transitions. [2019-11-28 15:23:11,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 15:23:11,632 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-11-28 15:23:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:23:11,635 INFO L225 Difference]: With dead ends: 457 [2019-11-28 15:23:11,636 INFO L226 Difference]: Without dead ends: 450 [2019-11-28 15:23:11,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2019-11-28 15:23:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-28 15:23:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 190. [2019-11-28 15:23:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-28 15:23:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 259 transitions. [2019-11-28 15:23:11,676 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 259 transitions. Word has length 36 [2019-11-28 15:23:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:23:11,676 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 259 transitions. [2019-11-28 15:23:11,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 15:23:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 259 transitions. [2019-11-28 15:23:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:23:11,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:11,679 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:11,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 15:23:11,890 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:11,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1862255225, now seen corresponding path program 1 times [2019-11-28 15:23:11,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:11,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057821880] [2019-11-28 15:23:11,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 15:23:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:23:12,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 15:23:12,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:12,304 INFO L377 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 17 treesize of output 9 [2019-11-28 15:23:12,305 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:23:12,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:12,320 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:23:12,320 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-28 15:23:12,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-28 15:23:12,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:23:12,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:12,400 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 15:23:12,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2019-11-28 15:23:12,532 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 15:23:12,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:12,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 12 [2019-11-28 15:23:12,536 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:23:12,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:12,547 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:23:12,547 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-11-28 15:23:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 15:23:12,582 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:12,687 INFO L377 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 19 treesize of output 17 [2019-11-28 15:23:12,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-28 15:23:12,697 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-28 15:23:12,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:12,705 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-28 15:23:12,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:12,713 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 15:23:12,713 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:16 [2019-11-28 15:23:12,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:23:12,931 INFO L377 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 14 treesize of output 6 [2019-11-28 15:23:12,934 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:23:12,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:12,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2019-11-28 15:23:12,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 15:23:12,965 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-28 15:23:12,980 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:12,981 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-28 15:23:12,981 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:18 [2019-11-28 15:23:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:23:13,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057821880] [2019-11-28 15:23:13,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:23:13,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-11-28 15:23:13,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828025733] [2019-11-28 15:23:13,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 15:23:13,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:23:13,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 15:23:13,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-11-28 15:23:13,328 INFO L87 Difference]: Start difference. First operand 190 states and 259 transitions. Second operand 24 states. [2019-11-28 15:23:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:23:15,273 INFO L93 Difference]: Finished difference Result 250 states and 321 transitions. [2019-11-28 15:23:15,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 15:23:15,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2019-11-28 15:23:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:23:15,277 INFO L225 Difference]: With dead ends: 250 [2019-11-28 15:23:15,277 INFO L226 Difference]: Without dead ends: 240 [2019-11-28 15:23:15,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=323, Invalid=1159, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 15:23:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-28 15:23:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 203. [2019-11-28 15:23:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-28 15:23:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 274 transitions. [2019-11-28 15:23:15,299 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 274 transitions. Word has length 36 [2019-11-28 15:23:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:23:15,299 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 274 transitions. [2019-11-28 15:23:15,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 15:23:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 274 transitions. [2019-11-28 15:23:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:23:15,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:23:15,303 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:23:15,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 15:23:15,510 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:23:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:23:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash 264677699, now seen corresponding path program 2 times [2019-11-28 15:23:15,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:23:15,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814763519] [2019-11-28 15:23:15,513 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-28 15:23:15,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:23:15,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:23:15,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 15:23:15,647 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:15,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 15:23:15,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:15,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 22 [2019-11-28 15:23:15,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:23:15,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:15,798 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:23:15,799 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:22 [2019-11-28 15:23:15,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 15:23:15,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-11-28 15:23:15,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:23:15,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:15,907 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:23:15,907 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2019-11-28 15:23:15,965 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 15:23:15,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 15:23:15,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:15,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2019-11-28 15:23:15,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:23:16,023 INFO L614 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-28 15:23:16,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:23:16,027 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:16 [2019-11-28 15:23:16,069 INFO L377 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 17 treesize of output 9 [2019-11-28 15:23:16,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:23:16,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:16,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:23:16,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-28 15:23:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 15:23:16,102 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:23:16,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:23:16,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2019-11-28 15:23:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:23:16,763 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_16], 1=[v_arrayElimCell_15]} [2019-11-28 15:23:16,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814763519] [2019-11-28 15:23:16,769 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58535b8b [2019-11-28 15:23:16,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1322322635] [2019-11-28 15:23:16,770 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-28 15:23:17,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:23:17,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:23:17,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 15:23:17,035 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:17,040 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58535b8b [2019-11-28 15:23:17,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699118487] [2019-11-28 15:23:17,041 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:23:17,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:23:17,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:23:17,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 15:23:17,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:23:17,127 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58535b8b [2019-11-28 15:23:17,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:23:17,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-11-28 15:23:17,128 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-11-28 15:23:17,128 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:23:17,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-28 15:23:17,758 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-11-28 15:23:17,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:23:17 BoogieIcfgContainer [2019-11-28 15:23:17,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:23:17,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:23:17,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:23:17,759 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:23:17,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:23:04" (3/4) ... [2019-11-28 15:23:17,763 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 15:23:17,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:23:17,765 INFO L168 Benchmark]: Toolchain (without parser) took 13777.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -105.4 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:17,765 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:23:17,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.12 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:17,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:17,767 INFO L168 Benchmark]: Boogie Preprocessor took 36.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:17,768 INFO L168 Benchmark]: RCFGBuilder took 474.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:17,768 INFO L168 Benchmark]: TraceAbstraction took 12798.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.6 MB). Peak memory consumption was 161.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:23:17,769 INFO L168 Benchmark]: Witness Printer took 4.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:23:17,772 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.12 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 474.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12798.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.6 MB). Peak memory consumption was 161.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 42]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L4] int N; [L22] N = __VERIFIER_nondet_int() [L23] COND TRUE N > 1 [L24] int x[N]; [L25] int temp; [L26] int ret; [L27] int ret2; [L28] int ret5; [L8] long long ret =0; [L9] int i=0; [L9] COND TRUE i