./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 30f4e4ab 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: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:18:10,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:18:10,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:18:10,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:18:10,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:18:10,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:18:10,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:18:10,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:18:10,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:18:10,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:18:10,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:18:10,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:18:10,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:18:10,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:18:10,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:18:10,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:18:10,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:18:10,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:18:10,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:18:10,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:18:10,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:18:10,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:18:10,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:18:10,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:18:10,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:18:10,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:18:10,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:18:10,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:18:10,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:18:10,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:18:10,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:18:10,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:18:10,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:18:10,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:18:10,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:18:10,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:18:10,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:18:10,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:18:10,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:18:10,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:18:10,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:18:10,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:18:10,936 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:18:10,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:18:10,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:18:10,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:18:10,940 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:18:10,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:18:10,940 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:18:10,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:18:10,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:18:10,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:18:10,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:18:10,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:18:10,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:18:10,944 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:18:10,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:18:10,944 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:18:10,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:18:10,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:18:10,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:18:10,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:18:10,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:18:10,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:18:10,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:18:10,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:18:10,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:18:10,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:18:10,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:18:10,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:18:10,948 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-27 22:18:11,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:18:11,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:18:11,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:18:11,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:18:11,280 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:18:11,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2019-11-27 22:18:11,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e139826bb/d9df2bb207e74966922b3ae5837d135d/FLAG23f14075a [2019-11-27 22:18:11,833 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:18:11,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2019-11-27 22:18:11,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e139826bb/d9df2bb207e74966922b3ae5837d135d/FLAG23f14075a [2019-11-27 22:18:12,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e139826bb/d9df2bb207e74966922b3ae5837d135d [2019-11-27 22:18:12,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:18:12,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:18:12,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:18:12,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:18:12,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:18:12,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c48454f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12, skipping insertion in model container [2019-11-27 22:18:12,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:18:12,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:18:12,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:18:12,538 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:18:12,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:18:12,574 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:18:12,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12 WrapperNode [2019-11-27 22:18:12,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:18:12,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:18:12,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:18:12,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:18:12,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:18:12,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:18:12,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:18:12,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:18:12,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (1/1) ... [2019-11-27 22:18:12,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:18:12,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:18:12,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:18:12,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:18:12,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (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-27 22:18:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 22:18:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:18:12,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:18:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 22:18:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 22:18:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 22:18:13,185 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:18:13,186 INFO L297 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-27 22:18:13,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:18:13 BoogieIcfgContainer [2019-11-27 22:18:13,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:18:13,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:18:13,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:18:13,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:18:13,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:18:12" (1/3) ... [2019-11-27 22:18:13,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674042c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:18:13, skipping insertion in model container [2019-11-27 22:18:13,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:12" (2/3) ... [2019-11-27 22:18:13,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674042c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:18:13, skipping insertion in model container [2019-11-27 22:18:13,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:18:13" (3/3) ... [2019-11-27 22:18:13,196 INFO L109 eAbstractionObserver]: Analyzing ICFG sep.i [2019-11-27 22:18:13,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:18:13,210 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:18:13,222 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:18:13,243 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:18:13,243 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:18:13,243 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:18:13,243 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:18:13,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:18:13,244 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:18:13,244 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:18:13,244 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:18:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-27 22:18:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:18:13,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:13,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:18:13,266 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash -805411982, now seen corresponding path program 1 times [2019-11-27 22:18:13,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:18:13,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043141524] [2019-11-27 22:18:13,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:18:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:13,402 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-27 22:18:13,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043141524] [2019-11-27 22:18:13,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:18:13,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:18:13,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101668200] [2019-11-27 22:18:13,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:18:13,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:18:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:18:13,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:18:13,422 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-27 22:18:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:13,440 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-27 22:18:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:18:13,442 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-27 22:18:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:13,449 INFO L225 Difference]: With dead ends: 52 [2019-11-27 22:18:13,450 INFO L226 Difference]: Without dead ends: 24 [2019-11-27 22:18:13,453 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-27 22:18:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-27 22:18:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-27 22:18:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-27 22:18:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-27 22:18:13,485 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2019-11-27 22:18:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:13,486 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-27 22:18:13,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:18:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-27 22:18:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:18:13,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:13,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:18:13,488 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1872946201, now seen corresponding path program 1 times [2019-11-27 22:18:13,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:18:13,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824434098] [2019-11-27 22:18:13,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:18:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:13,586 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-27 22:18:13,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824434098] [2019-11-27 22:18:13,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:18:13,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:18:13,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935016266] [2019-11-27 22:18:13,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:18:13,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:18:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:18:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:18:13,590 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 3 states. [2019-11-27 22:18:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:13,636 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2019-11-27 22:18:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:18:13,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:18:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:13,638 INFO L225 Difference]: With dead ends: 45 [2019-11-27 22:18:13,638 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 22:18:13,640 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-27 22:18:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 22:18:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-27 22:18:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 22:18:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-27 22:18:13,646 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2019-11-27 22:18:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:13,647 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-27 22:18:13,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:18:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-11-27 22:18:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:18:13,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:13,648 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-27 22:18:13,649 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash -567209286, now seen corresponding path program 1 times [2019-11-27 22:18:13,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:18:13,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492938132] [2019-11-27 22:18:13,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:18:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:13,763 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-27 22:18:13,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492938132] [2019-11-27 22:18:13,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:18:13,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:18:13,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114061553] [2019-11-27 22:18:13,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:18:13,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:18:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:18:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:18:13,766 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 4 states. [2019-11-27 22:18:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:13,830 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-11-27 22:18:13,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:18:13,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-27 22:18:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:13,832 INFO L225 Difference]: With dead ends: 46 [2019-11-27 22:18:13,832 INFO L226 Difference]: Without dead ends: 33 [2019-11-27 22:18:13,833 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-27 22:18:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-27 22:18:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-27 22:18:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 22:18:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-27 22:18:13,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 19 [2019-11-27 22:18:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:13,841 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-27 22:18:13,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:18:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-11-27 22:18:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:18:13,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:13,842 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-27 22:18:13,843 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2050984225, now seen corresponding path program 1 times [2019-11-27 22:18:13,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:18:13,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548062910] [2019-11-27 22:18:13,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:18:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:14,010 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-27 22:18:14,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548062910] [2019-11-27 22:18:14,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:18:14,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:18:14,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551549075] [2019-11-27 22:18:14,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:18:14,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:18:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:18:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:18:14,014 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2019-11-27 22:18:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:14,085 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-11-27 22:18:14,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:18:14,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-27 22:18:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:14,088 INFO L225 Difference]: With dead ends: 39 [2019-11-27 22:18:14,088 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 22:18:14,091 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-27 22:18:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 22:18:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-27 22:18:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 22:18:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-27 22:18:14,100 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2019-11-27 22:18:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:14,101 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-27 22:18:14,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:18:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-27 22:18:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 22:18:14,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:14,103 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-27 22:18:14,104 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1500824769, now seen corresponding path program 1 times [2019-11-27 22:18:14,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:18:14,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051778408] [2019-11-27 22:18:14,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:18:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:14,225 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-27 22:18:14,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051778408] [2019-11-27 22:18:14,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182295015] [2019-11-27 22:18:14,226 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-27 22:18:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:14,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:18:14,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:14,382 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-27 22:18:14,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:18:14,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-27 22:18:14,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879048668] [2019-11-27 22:18:14,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:18:14,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:18:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:18:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:18:14,389 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 6 states. [2019-11-27 22:18:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:14,455 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2019-11-27 22:18:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:18:14,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-27 22:18:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:14,457 INFO L225 Difference]: With dead ends: 54 [2019-11-27 22:18:14,457 INFO L226 Difference]: Without dead ends: 33 [2019-11-27 22:18:14,458 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-27 22:18:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-27 22:18:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-27 22:18:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 22:18:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-27 22:18:14,464 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 27 [2019-11-27 22:18:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:14,465 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-27 22:18:14,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:18:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-27 22:18:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:18:14,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:14,467 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-27 22:18:14,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:18:14,671 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:14,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1175870478, now seen corresponding path program 2 times [2019-11-27 22:18:14,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:18:14,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048931523] [2019-11-27 22:18:14,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:18:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:14,779 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-27 22:18:14,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048931523] [2019-11-27 22:18:14,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052442611] [2019-11-27 22:18:14,781 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-27 22:18:14,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:18:14,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:18:14,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:18:14,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:14,904 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-27 22:18:14,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:18:14,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-27 22:18:14,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385287725] [2019-11-27 22:18:14,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:18:14,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:18:14,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:18:14,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:18:14,912 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 7 states. [2019-11-27 22:18:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:15,020 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2019-11-27 22:18:15,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:18:15,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-27 22:18:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:15,022 INFO L225 Difference]: With dead ends: 58 [2019-11-27 22:18:15,022 INFO L226 Difference]: Without dead ends: 43 [2019-11-27 22:18:15,023 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-27 22:18:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-27 22:18:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-11-27 22:18:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-27 22:18:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2019-11-27 22:18:15,030 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 30 [2019-11-27 22:18:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:15,031 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-11-27 22:18:15,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:18:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2019-11-27 22:18:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:18:15,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:15,033 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-27 22:18:15,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:18:15,234 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:15,234 INFO L82 PathProgramCache]: Analyzing trace with hash 657704709, now seen corresponding path program 3 times [2019-11-27 22:18:15,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:18:15,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842102090] [2019-11-27 22:18:15,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:18:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:16,118 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-27 22:18:16,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842102090] [2019-11-27 22:18:16,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415630686] [2019-11-27 22:18:16,121 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-27 22:18:16,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 22:18:16,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:18:16,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-27 22:18:16,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:18:16,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:18:16,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:18:33,767 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-27 22:18:33,768 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: SMTLIBException [2019-11-27 22:18:33,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:18:33,970 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2019-11-27 22:18:33,984 INFO L168 Benchmark]: Toolchain (without parser) took 21698.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 960.4 MB in the beginning and 840.6 MB in the end (delta: 119.8 MB). Peak memory consumption was 254.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:33,984 INFO L168 Benchmark]: CDTParser took 0.26 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-27 22:18:33,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:33,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:33,991 INFO L168 Benchmark]: Boogie Preprocessor took 41.69 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-27 22:18:33,994 INFO L168 Benchmark]: RCFGBuilder took 440.98 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.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:33,995 INFO L168 Benchmark]: TraceAbstraction took 20788.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 840.6 MB in the end (delta: 258.2 MB). Peak memory consumption was 258.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:34,005 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.26 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 292.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 129.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.69 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 440.98 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.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20788.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 840.6 MB in the end (delta: 258.2 MB). Peak memory consumption was 258.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:18:35,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:18:35,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:18:35,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:18:35,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:18:35,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:18:35,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:18:35,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:18:35,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:18:35,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:18:35,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:18:35,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:18:35,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:18:35,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:18:35,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:18:35,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:18:35,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:18:35,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:18:35,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:18:35,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:18:35,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:18:35,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:18:35,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:18:35,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:18:35,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:18:35,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:18:35,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:18:35,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:18:35,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:18:35,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:18:35,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:18:35,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:18:35,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:18:35,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:18:35,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:18:35,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:18:35,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:18:35,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:18:35,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:18:35,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:18:35,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:18:35,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 22:18:36,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:18:36,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:18:36,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:18:36,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:18:36,023 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:18:36,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:18:36,023 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:18:36,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:18:36,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:18:36,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:18:36,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:18:36,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:18:36,026 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 22:18:36,027 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 22:18:36,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:18:36,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:18:36,028 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:18:36,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:18:36,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:18:36,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:18:36,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:18:36,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:18:36,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:18:36,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:18:36,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:18:36,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:18:36,031 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 22:18:36,031 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 22:18:36,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:18:36,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 22:18:36,032 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-27 22:18:36,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:18:36,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:18:36,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:18:36,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:18:36,374 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:18:36,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2019-11-27 22:18:36,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76efa5e14/56e53e33bb0242e697f80968426b6e47/FLAG430a5e468 [2019-11-27 22:18:36,889 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:18:36,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2019-11-27 22:18:36,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76efa5e14/56e53e33bb0242e697f80968426b6e47/FLAG430a5e468 [2019-11-27 22:18:37,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76efa5e14/56e53e33bb0242e697f80968426b6e47 [2019-11-27 22:18:37,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:18:37,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:18:37,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:18:37,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:18:37,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:18:37,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14911ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37, skipping insertion in model container [2019-11-27 22:18:37,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:18:37,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:18:37,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:18:37,483 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:18:37,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:18:37,522 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:18:37,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37 WrapperNode [2019-11-27 22:18:37,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:18:37,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:18:37,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:18:37,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:18:37,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:18:37,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:18:37,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:18:37,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:18:37,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (1/1) ... [2019-11-27 22:18:37,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:18:37,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:18:37,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:18:37,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:18:37,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (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-27 22:18:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 22:18:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:18:37,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:18:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 22:18:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 22:18:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 22:18:38,100 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:18:38,100 INFO L297 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-27 22:18:38,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:18:38 BoogieIcfgContainer [2019-11-27 22:18:38,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:18:38,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:18:38,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:18:38,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:18:38,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:18:37" (1/3) ... [2019-11-27 22:18:38,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139a0316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:18:38, skipping insertion in model container [2019-11-27 22:18:38,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:18:37" (2/3) ... [2019-11-27 22:18:38,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139a0316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:18:38, skipping insertion in model container [2019-11-27 22:18:38,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:18:38" (3/3) ... [2019-11-27 22:18:38,111 INFO L109 eAbstractionObserver]: Analyzing ICFG sep.i [2019-11-27 22:18:38,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:18:38,124 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:18:38,136 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:18:38,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:18:38,156 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:18:38,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:18:38,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:18:38,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:18:38,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:18:38,157 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:18:38,157 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:18:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-27 22:18:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:18:38,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:38,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:18:38,178 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash -805411982, now seen corresponding path program 1 times [2019-11-27 22:18:38,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:38,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263641404] [2019-11-27 22:18:38,195 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-27 22:18:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:38,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 22:18:38,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:38,347 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-27 22:18:38,348 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:38,354 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-27 22:18:38,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263641404] [2019-11-27 22:18:38,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:18:38,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 22:18:38,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988086444] [2019-11-27 22:18:38,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:18:38,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:18:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:18:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:18:38,383 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-27 22:18:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:38,406 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-27 22:18:38,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:18:38,408 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-27 22:18:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:38,420 INFO L225 Difference]: With dead ends: 52 [2019-11-27 22:18:38,420 INFO L226 Difference]: Without dead ends: 24 [2019-11-27 22:18:38,424 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-27 22:18:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-27 22:18:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-27 22:18:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-27 22:18:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-27 22:18:38,464 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2019-11-27 22:18:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:38,465 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-27 22:18:38,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:18:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-27 22:18:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:18:38,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:38,466 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:18:38,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 22:18:38,668 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1872946201, now seen corresponding path program 1 times [2019-11-27 22:18:38,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:38,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686780801] [2019-11-27 22:18:38,672 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-27 22:18:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:38,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 22:18:38,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:38,948 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-27 22:18:38,948 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:39,111 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-27 22:18:39,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686780801] [2019-11-27 22:18:39,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:18:39,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 15 [2019-11-27 22:18:39,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070752562] [2019-11-27 22:18:39,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 22:18:39,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:18:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 22:18:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-27 22:18:39,117 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 15 states. [2019-11-27 22:18:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:39,560 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2019-11-27 22:18:39,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:18:39,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-11-27 22:18:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:39,566 INFO L225 Difference]: With dead ends: 64 [2019-11-27 22:18:39,567 INFO L226 Difference]: Without dead ends: 59 [2019-11-27 22:18:39,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-11-27 22:18:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-27 22:18:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2019-11-27 22:18:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-27 22:18:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-11-27 22:18:39,594 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 16 [2019-11-27 22:18:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:39,595 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-27 22:18:39,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 22:18:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2019-11-27 22:18:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:18:39,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:39,602 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-27 22:18:39,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 22:18:39,824 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:39,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:39,825 INFO L82 PathProgramCache]: Analyzing trace with hash -528068644, now seen corresponding path program 1 times [2019-11-27 22:18:39,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:39,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563565155] [2019-11-27 22:18:39,826 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-27 22:18:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:39,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:18:39,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:39,926 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-27 22:18:39,926 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:39,947 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-27 22:18:39,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563565155] [2019-11-27 22:18:39,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:18:39,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 22:18:39,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156279307] [2019-11-27 22:18:39,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:18:39,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:18:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:18:39,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:18:39,950 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 4 states. [2019-11-27 22:18:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:40,018 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-11-27 22:18:40,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:18:40,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-27 22:18:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:40,020 INFO L225 Difference]: With dead ends: 55 [2019-11-27 22:18:40,021 INFO L226 Difference]: Without dead ends: 28 [2019-11-27 22:18:40,021 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-27 22:18:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-27 22:18:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-27 22:18:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 22:18:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-27 22:18:40,027 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2019-11-27 22:18:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:40,028 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-27 22:18:40,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:18:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-27 22:18:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:18:40,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:40,029 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-27 22:18:40,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 22:18:40,231 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash -877574393, now seen corresponding path program 1 times [2019-11-27 22:18:40,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:40,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804990703] [2019-11-27 22:18:40,234 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-27 22:18:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:40,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 22:18:40,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:40,411 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-27 22:18:40,411 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:40,548 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-27 22:18:40,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804990703] [2019-11-27 22:18:40,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:18:40,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-27 22:18:40,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767928590] [2019-11-27 22:18:40,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 22:18:40,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:18:40,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 22:18:40,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:18:40,551 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 12 states. [2019-11-27 22:18:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:40,870 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2019-11-27 22:18:40,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 22:18:40,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-27 22:18:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:40,872 INFO L225 Difference]: With dead ends: 77 [2019-11-27 22:18:40,873 INFO L226 Difference]: Without dead ends: 61 [2019-11-27 22:18:40,874 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-27 22:18:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-27 22:18:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-11-27 22:18:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-27 22:18:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-11-27 22:18:40,884 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 22 [2019-11-27 22:18:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:40,884 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-11-27 22:18:40,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 22:18:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-11-27 22:18:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:18:40,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:40,887 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-27 22:18:41,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 22:18:41,103 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:41,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1474637889, now seen corresponding path program 1 times [2019-11-27 22:18:41,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:41,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573399367] [2019-11-27 22:18:41,104 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-27 22:18:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:41,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 22:18:41,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:41,348 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-27 22:18:41,349 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:41,605 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-27 22:18:41,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573399367] [2019-11-27 22:18:41,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:18:41,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-27 22:18:41,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363708312] [2019-11-27 22:18:41,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 22:18:41,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:18:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 22:18:41,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-27 22:18:41,609 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 16 states. [2019-11-27 22:18:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:42,192 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2019-11-27 22:18:42,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 22:18:42,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-27 22:18:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:42,194 INFO L225 Difference]: With dead ends: 140 [2019-11-27 22:18:42,194 INFO L226 Difference]: Without dead ends: 123 [2019-11-27 22:18:42,195 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-27 22:18:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-27 22:18:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2019-11-27 22:18:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 22:18:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-11-27 22:18:42,210 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 31 [2019-11-27 22:18:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:42,210 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-11-27 22:18:42,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 22:18:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-11-27 22:18:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 22:18:42,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:42,212 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-27 22:18:42,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 22:18:42,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:42,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2038223641, now seen corresponding path program 2 times [2019-11-27 22:18:42,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:42,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153350734] [2019-11-27 22:18:42,418 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-27 22:18:42,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 22:18:42,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:18:42,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:18:42,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:42,486 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-27 22:18:42,487 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:42,543 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-27 22:18:42,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153350734] [2019-11-27 22:18:42,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:18:42,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 22:18:42,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983238887] [2019-11-27 22:18:42,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:18:42,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:18:42,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:18:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:18:42,545 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 6 states. [2019-11-27 22:18:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:42,634 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2019-11-27 22:18:42,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:18:42,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-27 22:18:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:42,636 INFO L225 Difference]: With dead ends: 128 [2019-11-27 22:18:42,637 INFO L226 Difference]: Without dead ends: 99 [2019-11-27 22:18:42,637 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-27 22:18:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-27 22:18:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-11-27 22:18:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 22:18:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-11-27 22:18:42,652 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 34 [2019-11-27 22:18:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:42,653 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-11-27 22:18:42,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:18:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-11-27 22:18:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:18:42,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:42,660 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-27 22:18:42,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 22:18:42,862 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:42,863 INFO L82 PathProgramCache]: Analyzing trace with hash 657704709, now seen corresponding path program 1 times [2019-11-27 22:18:42,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:42,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846870552] [2019-11-27 22:18:42,864 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-27 22:18:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:42,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-27 22:18:42,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:43,194 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-27 22:18:43,195 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:43,581 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-27 22:18:43,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846870552] [2019-11-27 22:18:43,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:18:43,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-11-27 22:18:43,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361050795] [2019-11-27 22:18:43,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-27 22:18:43,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:18:43,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-27 22:18:43,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-11-27 22:18:43,585 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand 27 states. [2019-11-27 22:18:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:44,720 INFO L93 Difference]: Finished difference Result 457 states and 585 transitions. [2019-11-27 22:18:44,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 22:18:44,722 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-11-27 22:18:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:44,726 INFO L225 Difference]: With dead ends: 457 [2019-11-27 22:18:44,726 INFO L226 Difference]: Without dead ends: 450 [2019-11-27 22:18:44,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2019-11-27 22:18:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-27 22:18:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 190. [2019-11-27 22:18:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-27 22:18:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 259 transitions. [2019-11-27 22:18:44,786 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 259 transitions. Word has length 36 [2019-11-27 22:18:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:44,789 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 259 transitions. [2019-11-27 22:18:44,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-27 22:18:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 259 transitions. [2019-11-27 22:18:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:18:44,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:44,797 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-27 22:18:45,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 22:18:45,018 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1862255225, now seen corresponding path program 1 times [2019-11-27 22:18:45,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:45,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814516230] [2019-11-27 22:18:45,019 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-27 22:18:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:18:45,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-27 22:18:45,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:45,351 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-27 22:18:45,353 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:18:45,364 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:45,364 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:18:45,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-27 22:18:45,407 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-27 22:18:45,407 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:18:45,429 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:45,430 INFO L508 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-27 22:18:45,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2019-11-27 22:18:45,530 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 22:18:45,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:45,534 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-27 22:18:45,534 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:18:45,543 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:45,544 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:18:45,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-11-27 22:18:45,572 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-27 22:18:45,572 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:45,667 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-27 22:18:45,675 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-27 22:18:45,677 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-27 22:18:45,684 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:45,684 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-27 22:18:45,691 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:45,692 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-27 22:18:45,692 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:16 [2019-11-27 22:18:45,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:18:45,855 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-27 22:18:45,857 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:18:45,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:45,877 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-27 22:18:45,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 22:18:45,882 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-27 22:18:45,899 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:45,900 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-27 22:18:45,900 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:18 [2019-11-27 22:18:46,206 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-27 22:18:46,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814516230] [2019-11-27 22:18:46,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:18:46,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-11-27 22:18:46,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375993827] [2019-11-27 22:18:46,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-27 22:18:46,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:18:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-27 22:18:46,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-11-27 22:18:46,210 INFO L87 Difference]: Start difference. First operand 190 states and 259 transitions. Second operand 24 states. [2019-11-27 22:18:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:18:48,004 INFO L93 Difference]: Finished difference Result 250 states and 321 transitions. [2019-11-27 22:18:48,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 22:18:48,005 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2019-11-27 22:18:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:18:48,007 INFO L225 Difference]: With dead ends: 250 [2019-11-27 22:18:48,007 INFO L226 Difference]: Without dead ends: 240 [2019-11-27 22:18:48,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=323, Invalid=1159, Unknown=0, NotChecked=0, Total=1482 [2019-11-27 22:18:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-27 22:18:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 203. [2019-11-27 22:18:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-27 22:18:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 274 transitions. [2019-11-27 22:18:48,035 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 274 transitions. Word has length 36 [2019-11-27 22:18:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:18:48,036 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 274 transitions. [2019-11-27 22:18:48,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-27 22:18:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 274 transitions. [2019-11-27 22:18:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:18:48,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:18:48,043 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-27 22:18:48,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 22:18:48,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:18:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:18:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash 264677699, now seen corresponding path program 2 times [2019-11-27 22:18:48,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:18:48,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716665651] [2019-11-27 22:18:48,260 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-27 22:18:48,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:18:48,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:18:48,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 22:18:48,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:18:48,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 22:18:48,595 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:48,595 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-27 22:18:48,596 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:18:48,609 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:48,610 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:18:48,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:22 [2019-11-27 22:18:48,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 22:18:48,693 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-27 22:18:48,693 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:18:48,710 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:48,710 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:18:48,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2019-11-27 22:18:48,771 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 22:18:48,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 22:18:48,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:48,775 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-27 22:18:48,776 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:18:48,837 INFO L588 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-27 22:18:48,841 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:18:48,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:16 [2019-11-27 22:18:48,896 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-27 22:18:48,896 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:18:48,900 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:48,900 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:18:48,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-27 22:18:48,947 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-27 22:18:48,947 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:18:49,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:18:49,600 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-27 22:18:49,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:18:49,609 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_16], 1=[v_arrayElimCell_15]} [2019-11-27 22:18:49,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 22:18:49,816 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 22:18:49,823 INFO L168 Benchmark]: Toolchain (without parser) took 12559.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 268.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -132.4 MB). Peak memory consumption was 136.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:49,823 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-27 22:18:49,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.65 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 949.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:49,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:49,828 INFO L168 Benchmark]: Boogie Preprocessor took 34.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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:49,829 INFO L168 Benchmark]: RCFGBuilder took 438.60 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:49,829 INFO L168 Benchmark]: TraceAbstraction took 11718.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 138.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:18:49,833 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 258.65 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 949.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 438.60 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11718.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 138.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...