./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d15e59fd1b84d7219285b33cc166f567d0bcf3e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:07:57,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:07:57,699 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:07:57,711 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:07:57,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:07:57,713 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:07:57,714 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:07:57,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:07:57,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:07:57,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:07:57,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:07:57,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:07:57,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:07:57,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:07:57,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:07:57,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:07:57,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:07:57,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:07:57,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:07:57,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:07:57,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:07:57,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:07:57,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:07:57,738 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:07:57,738 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:07:57,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:07:57,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:07:57,742 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:07:57,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:07:57,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:07:57,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:07:57,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:07:57,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:07:57,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:07:57,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:07:57,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:07:57,748 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:07:57,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:07:57,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:07:57,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:07:57,765 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:07:57,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:07:57,767 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:07:57,767 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:07:57,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:07:57,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:07:57,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:07:57,768 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:07:57,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:07:57,769 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:07:57,769 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:07:57,769 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:07:57,769 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:07:57,769 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:07:57,769 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:07:57,770 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:07:57,770 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:07:57,770 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:07:57,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:07:57,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:07:57,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:07:57,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:07:57,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:07:57,773 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:07:57,773 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:07:57,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:07:57,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:07:57,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d15e59fd1b84d7219285b33cc166f567d0bcf3e [2018-11-28 18:07:57,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:07:57,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:07:57,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:07:57,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:07:57,842 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:07:57,842 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-28 18:07:57,912 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50038c42d/2744876859b34baea5d1a97fadb8edc2/FLAGc3a4000c1 [2018-11-28 18:07:58,386 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:07:58,387 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-28 18:07:58,394 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50038c42d/2744876859b34baea5d1a97fadb8edc2/FLAGc3a4000c1 [2018-11-28 18:07:58,871 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50038c42d/2744876859b34baea5d1a97fadb8edc2 [2018-11-28 18:07:58,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:07:58,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:07:58,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:07:58,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:07:58,883 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:07:58,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:58" (1/1) ... [2018-11-28 18:07:58,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a68efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:58, skipping insertion in model container [2018-11-28 18:07:58,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:58" (1/1) ... [2018-11-28 18:07:58,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:07:58,921 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:07:59,135 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:07:59,153 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:07:59,192 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:07:59,223 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:07:59,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59 WrapperNode [2018-11-28 18:07:59,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:07:59,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:07:59,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:07:59,225 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:07:59,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:07:59,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:07:59,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:07:59,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:07:59,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... [2018-11-28 18:07:59,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:07:59,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:07:59,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:07:59,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:07:59,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:07:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:07:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:07:59,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:07:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-28 18:07:59,449 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-28 18:07:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:07:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:07:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:07:59,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:07:59,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:07:59,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:07:59,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:07:59,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:07:59,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:07:59,958 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:07:59,958 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 18:07:59,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:59 BoogieIcfgContainer [2018-11-28 18:07:59,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:07:59,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:07:59,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:07:59,964 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:07:59,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:07:58" (1/3) ... [2018-11-28 18:07:59,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fc4fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:59, skipping insertion in model container [2018-11-28 18:07:59,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:59" (2/3) ... [2018-11-28 18:07:59,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fc4fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:59, skipping insertion in model container [2018-11-28 18:07:59,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:59" (3/3) ... [2018-11-28 18:07:59,969 INFO L112 eAbstractionObserver]: Analyzing ICFG test27_false-unreach-call_true-termination.c [2018-11-28 18:07:59,980 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:07:59,989 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:08:00,008 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:08:00,041 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:08:00,042 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:08:00,042 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:08:00,042 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:08:00,044 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:08:00,044 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:08:00,044 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:08:00,044 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:08:00,045 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:08:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-28 18:08:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 18:08:00,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:00,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:00,073 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:00,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:00,079 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-11-28 18:08:00,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:00,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:00,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:00,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:00,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:08:00,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:08:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:08:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:08:00,263 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-28 18:08:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:00,282 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-28 18:08:00,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:08:00,284 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-28 18:08:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:00,294 INFO L225 Difference]: With dead ends: 42 [2018-11-28 18:08:00,295 INFO L226 Difference]: Without dead ends: 20 [2018-11-28 18:08:00,298 INFO L631 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 [2018-11-28 18:08:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-28 18:08:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 18:08:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 18:08:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-28 18:08:00,340 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-28 18:08:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:00,341 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-28 18:08:00,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:08:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-28 18:08:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 18:08:00,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:00,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:00,343 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:00,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-11-28 18:08:00,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:00,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:00,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:00,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:00,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:00,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:00,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:00,444 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-28 18:08:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:00,514 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-28 18:08:00,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:00,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 18:08:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:00,516 INFO L225 Difference]: With dead ends: 34 [2018-11-28 18:08:00,516 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 18:08:00,518 INFO L631 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 [2018-11-28 18:08:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 18:08:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 18:08:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:08:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 18:08:00,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-28 18:08:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:00,524 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 18:08:00,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-28 18:08:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:08:00,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:00,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:00,525 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:00,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-11-28 18:08:00,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:00,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:00,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:00,647 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:00,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:00,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:00,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:00,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 18:08:00,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:08:00,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:08:00,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:00,840 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-28 18:08:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:00,904 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-28 18:08:00,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:00,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 18:08:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:00,910 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:08:00,911 INFO L226 Difference]: Without dead ends: 24 [2018-11-28 18:08:00,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-28 18:08:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-28 18:08:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 18:08:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-28 18:08:00,917 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-28 18:08:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:00,918 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-28 18:08:00,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:08:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-28 18:08:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 18:08:00,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:00,920 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:00,921 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:00,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-11-28 18:08:00,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:00,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:00,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:01,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:01,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:01,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:08:01,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:08:01,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:01,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:01,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:01,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 18:08:01,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:08:01,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:08:01,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:08:01,276 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-28 18:08:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:01,371 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-28 18:08:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:08:01,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-28 18:08:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:01,373 INFO L225 Difference]: With dead ends: 38 [2018-11-28 18:08:01,374 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 18:08:01,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:08:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 18:08:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-28 18:08:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 18:08:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-28 18:08:01,380 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-28 18:08:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:01,380 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-28 18:08:01,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:08:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-28 18:08:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 18:08:01,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:01,381 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:01,382 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:01,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2113766385, now seen corresponding path program 3 times [2018-11-28 18:08:01,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:01,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:01,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:01,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:01,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:01,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:08:01,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 18:08:01,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:01,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 18:08:01,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:08:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:08:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:08:01,822 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-11-28 18:08:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:01,946 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-28 18:08:01,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:08:01,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 18:08:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:01,949 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:08:01,949 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 18:08:01,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:08:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 18:08:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-28 18:08:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 18:08:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-28 18:08:01,955 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-11-28 18:08:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:01,957 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-28 18:08:01,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:08:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-28 18:08:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:08:01,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:01,958 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:01,958 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:01,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1818492333, now seen corresponding path program 4 times [2018-11-28 18:08:01,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:01,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:01,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:01,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:02,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:02,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:02,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:08:02,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:08:02,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:02,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:02,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:02,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 18:08:02,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:08:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:08:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:08:02,378 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-11-28 18:08:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:02,650 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-28 18:08:02,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:08:02,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 18:08:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:02,659 INFO L225 Difference]: With dead ends: 42 [2018-11-28 18:08:02,659 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 18:08:02,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:08:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 18:08:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-28 18:08:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 18:08:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-28 18:08:02,666 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-28 18:08:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:02,667 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-28 18:08:02,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:08:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-28 18:08:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:08:02,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:02,668 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:02,668 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:02,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1147899851, now seen corresponding path program 5 times [2018-11-28 18:08:02,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:02,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:02,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:03,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:03,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:03,405 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:08:04,828 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 18:08:04,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:04,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:04,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:04,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 18:08:04,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:08:04,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:08:04,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:08:04,903 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-11-28 18:08:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:04,998 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-28 18:08:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:08:05,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-28 18:08:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:05,002 INFO L225 Difference]: With dead ends: 44 [2018-11-28 18:08:05,002 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:08:05,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:08:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:08:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-28 18:08:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 18:08:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-28 18:08:05,008 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-28 18:08:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:05,008 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-28 18:08:05,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:08:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-28 18:08:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:08:05,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:05,009 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:05,010 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:05,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash -953619049, now seen corresponding path program 6 times [2018-11-28 18:08:05,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:05,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:05,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:05,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:05,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:05,616 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:08:06,312 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 18:08:06,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:06,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:06,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:06,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 18:08:06,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:08:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:08:06,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:08:06,396 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-11-28 18:08:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:06,514 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-28 18:08:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:08:06,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-28 18:08:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:06,517 INFO L225 Difference]: With dead ends: 46 [2018-11-28 18:08:06,517 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 18:08:06,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:08:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 18:08:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-28 18:08:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 18:08:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-28 18:08:06,525 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-11-28 18:08:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:06,525 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-28 18:08:06,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:08:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-28 18:08:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 18:08:06,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:06,527 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:06,527 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:06,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1066637945, now seen corresponding path program 7 times [2018-11-28 18:08:06,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:06,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:06,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:06,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:06,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:06,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:06,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:06,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 18:08:06,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:08:06,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:08:06,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:08:06,827 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-28 18:08:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:06,895 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-28 18:08:06,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:08:06,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-28 18:08:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:06,906 INFO L225 Difference]: With dead ends: 48 [2018-11-28 18:08:06,906 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:08:06,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:08:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:08:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-28 18:08:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 18:08:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-28 18:08:06,915 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-11-28 18:08:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:06,915 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-28 18:08:06,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:08:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-28 18:08:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:08:06,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:06,919 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:06,919 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:06,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:06,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1208391387, now seen corresponding path program 8 times [2018-11-28 18:08:06,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:06,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:06,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:07,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:07,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:07,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:08:07,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:08:07,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:07,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:07,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:07,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 18:08:07,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:08:07,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:08:07,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:08:07,379 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-11-28 18:08:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:07,465 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-28 18:08:07,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:08:07,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-28 18:08:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:07,471 INFO L225 Difference]: With dead ends: 50 [2018-11-28 18:08:07,471 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 18:08:07,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:08:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 18:08:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-28 18:08:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 18:08:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-28 18:08:07,477 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-11-28 18:08:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:07,477 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-28 18:08:07,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:08:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-28 18:08:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 18:08:07,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:07,479 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:07,479 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:07,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -5504323, now seen corresponding path program 9 times [2018-11-28 18:08:07,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:07,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:07,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:07,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:07,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:07,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:07,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:08:14,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-28 18:08:14,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:14,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:14,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:14,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-28 18:08:14,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 18:08:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 18:08:14,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:08:14,673 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-11-28 18:08:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:14,764 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-28 18:08:14,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:08:14,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-28 18:08:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:14,766 INFO L225 Difference]: With dead ends: 51 [2018-11-28 18:08:14,766 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:08:14,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:08:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:08:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 18:08:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 18:08:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-28 18:08:14,773 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-11-28 18:08:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:14,773 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-28 18:08:14,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 18:08:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-28 18:08:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 18:08:14,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:14,782 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:14,782 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:14,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:14,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1671822879, now seen corresponding path program 10 times [2018-11-28 18:08:14,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:14,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:14,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:14,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:14,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:08:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:08:15,290 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:08:15,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:15 BoogieIcfgContainer [2018-11-28 18:08:15,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:08:15,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:08:15,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:08:15,393 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:08:15,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:59" (3/4) ... [2018-11-28 18:08:15,396 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:08:15,489 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:08:15,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:08:15,490 INFO L168 Benchmark]: Toolchain (without parser) took 16614.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 946.0 MB in the beginning and 993.8 MB in the end (delta: -47.9 MB). Peak memory consumption was 143.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:15,493 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:15,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.84 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:15,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.07 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:15,494 INFO L168 Benchmark]: Boogie Preprocessor took 120.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:15,497 INFO L168 Benchmark]: RCFGBuilder took 577.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:15,498 INFO L168 Benchmark]: TraceAbstraction took 15432.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.1 MB). Peak memory consumption was 160.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:15,503 INFO L168 Benchmark]: Witness Printer took 96.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:15,510 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.84 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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 37.07 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 577.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15432.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.1 MB). Peak memory consumption was 160.6 MB. Max. memory is 11.5 GB. * Witness Printer took 96.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 51]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=0] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=1] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=2] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=3] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=4] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=5] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=6] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=7] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=8] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=9] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L28] COND FALSE !(j < 10) VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] VAL [a={102:0}, a[i]=1, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10, pa={57:0}] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(&cont, i) VAL [\old(i)=0, pc={72:0}] [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] RET, EXPR check(&cont, i) VAL [a={102:0}, check(&cont, i)=0, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 15.3s OverallTime, 12 OverallIterations, 10 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 55 SDslu, 680 SDs, 0 SdLazy, 179 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 9.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 25833 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1395 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 0/570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...