./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --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/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.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 3aee1e8d9b723b18f218b6c1185554e637930c5d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:08:58,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:08:58,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:08:58,096 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:08:58,096 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:08:58,097 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:08:58,098 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:08:58,100 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:08:58,102 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:08:58,103 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:08:58,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:08:58,104 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:08:58,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:08:58,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:08:58,107 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:08:58,108 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:08:58,109 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:08:58,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:08:58,113 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:08:58,114 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:08:58,116 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:08:58,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:08:58,120 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:08:58,120 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:08:58,120 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:08:58,121 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:08:58,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:08:58,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:08:58,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:08:58,133 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:08:58,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:08:58,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:08:58,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:08:58,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:08:58,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:08:58,140 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:08:58,140 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:08:58,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:08:58,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:08:58,175 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:08:58,176 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:08:58,177 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:08:58,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:08:58,178 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:08:58,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:08:58,179 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:08:58,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:08:58,179 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:08:58,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:08:58,179 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:08:58,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:08:58,181 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:08:58,181 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:08:58,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:08:58,182 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:08:58,182 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:08:58,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:08:58,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:08:58,182 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:08:58,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:08:58,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:08:58,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:08:58,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:08:58,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:08:58,183 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:08:58,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:08:58,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:08:58,184 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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2018-11-28 18:08:58,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:08:58,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:08:58,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:08:58,250 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:08:58,251 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:08:58,251 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 18:08:58,312 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff4cf837/0bbb8c4285ed463dbdf9a5efbbb2aa0e/FLAG667992e52 [2018-11-28 18:08:58,870 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:08:58,871 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 18:08:58,893 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff4cf837/0bbb8c4285ed463dbdf9a5efbbb2aa0e/FLAG667992e52 [2018-11-28 18:08:59,148 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff4cf837/0bbb8c4285ed463dbdf9a5efbbb2aa0e [2018-11-28 18:08:59,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:08:59,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:08:59,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:59,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:08:59,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:08:59,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17189fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59, skipping insertion in model container [2018-11-28 18:08:59,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:08:59,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:08:59,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:59,651 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:08:59,710 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:59,840 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:08:59,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59 WrapperNode [2018-11-28 18:08:59,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:59,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:59,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:08:59,842 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:08:59,852 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:08:59" (1/1) ... [2018-11-28 18:08:59,868 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:08:59" (1/1) ... [2018-11-28 18:08:59,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:59,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:08:59,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:08:59,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:08:59,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59" (1/1) ... [2018-11-28 18:08:59,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:08:59,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:08:59,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:08:59,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:08:59,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08: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:08:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:08:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:08:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:08:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:08:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:08:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:08:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:08:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:08:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:08:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:08:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:08:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:09:00,528 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:09:00,528 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 18:09:00,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:09:00 BoogieIcfgContainer [2018-11-28 18:09:00,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:09:00,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:09:00,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:09:00,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:09:00,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:08:59" (1/3) ... [2018-11-28 18:09:00,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e568a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:09:00, skipping insertion in model container [2018-11-28 18:09:00,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:59" (2/3) ... [2018-11-28 18:09:00,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e568a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:09:00, skipping insertion in model container [2018-11-28 18:09:00,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:09:00" (3/3) ... [2018-11-28 18:09:00,538 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 18:09:00,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:09:00,555 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 18:09:00,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 18:09:00,605 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:09:00,606 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:09:00,606 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:09:00,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:09:00,607 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:09:00,607 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:09:00,607 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:09:00,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:09:00,607 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:09:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-28 18:09:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 18:09:00,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:00,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:00,635 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:00,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash -807935886, now seen corresponding path program 1 times [2018-11-28 18:09:00,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:00,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:00,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:00,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:00,795 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:09:00,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:00,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:09:00,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:09:00,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:09:00,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:09:00,815 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-28 18:09:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:00,841 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2018-11-28 18:09:00,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:09:00,843 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 18:09:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:00,853 INFO L225 Difference]: With dead ends: 59 [2018-11-28 18:09:00,853 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 18:09:00,857 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:09:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 18:09:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 18:09:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 18:09:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-28 18:09:00,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-11-28 18:09:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:00,891 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 18:09:00,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:09:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-28 18:09:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 18:09:00,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:00,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:00,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:00,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash 711422280, now seen corresponding path program 1 times [2018-11-28 18:09:00,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:00,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:00,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:00,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:01,026 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:09:01,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:01,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:09:01,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:09:01,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:09:01,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:09:01,031 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-28 18:09:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:01,281 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-28 18:09:01,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:09:01,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 18:09:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:01,283 INFO L225 Difference]: With dead ends: 35 [2018-11-28 18:09:01,284 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 18:09:01,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:09:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 18:09:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-28 18:09:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 18:09:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-28 18:09:01,291 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2018-11-28 18:09:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:01,291 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-28 18:09:01,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:09:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-28 18:09:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:09:01,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:01,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:01,293 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:01,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1678513884, now seen corresponding path program 1 times [2018-11-28 18:09:01,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:01,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:01,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:01,468 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:09:01,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:01,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:09:01,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:09:01,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:09:01,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:09:01,470 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-28 18:09:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:01,798 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-28 18:09:01,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:09:01,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:09:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:01,801 INFO L225 Difference]: With dead ends: 51 [2018-11-28 18:09:01,801 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 18:09:01,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:09:01,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 18:09:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-11-28 18:09:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 18:09:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-28 18:09:01,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2018-11-28 18:09:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:01,811 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-28 18:09:01,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:09:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-28 18:09:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 18:09:01,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:01,812 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:01,812 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:01,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:01,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1763906605, now seen corresponding path program 1 times [2018-11-28 18:09:01,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:01,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:01,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:02,174 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-11-28 18:09:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:02,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:09:02,364 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:09:02,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:02,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:09:02,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 18:09:02,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:09:02,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:09:02,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,795 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-28 18:09:02,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:02,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:02,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 18:09:02,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:09:02,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:09:02,979 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-28 18:09:02,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:02,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 18:09:02,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,019 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-28 18:09:03,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 18:09:03,024 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,035 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,068 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:56, output treesize:17 [2018-11-28 18:09:03,101 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 18:09:03,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:09:03,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 18:09:03,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-11-28 18:09:03,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 18:09:03,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:09:03,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 18:09:03,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,281 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-28 18:09:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:03,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:09:03,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-28 18:09:03,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:09:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:09:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:09:03,316 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2018-11-28 18:09:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:04,621 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2018-11-28 18:09:04,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 18:09:04,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-28 18:09:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:04,626 INFO L225 Difference]: With dead ends: 100 [2018-11-28 18:09:04,626 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 18:09:04,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-11-28 18:09:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 18:09:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 36. [2018-11-28 18:09:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 18:09:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-28 18:09:04,636 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2018-11-28 18:09:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:04,636 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-28 18:09:04,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:09:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-28 18:09:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:09:04,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:04,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:04,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:04,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1644345819, now seen corresponding path program 1 times [2018-11-28 18:09:04,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:04,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:04,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:04,769 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:09:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:04,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:09:04,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:09:04,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:09:04,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:09:04,772 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2018-11-28 18:09:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:04,860 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-28 18:09:04,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:09:04,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-28 18:09:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:04,862 INFO L225 Difference]: With dead ends: 52 [2018-11-28 18:09:04,862 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 18:09:04,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:09:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 18:09:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-28 18:09:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 18:09:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-28 18:09:04,872 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-11-28 18:09:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:04,872 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-28 18:09:04,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:09:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-28 18:09:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:09:04,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:04,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:04,874 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:04,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1644286237, now seen corresponding path program 1 times [2018-11-28 18:09:04,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:04,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:04,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:09:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:09:04,920 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:09:04,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:09:04 BoogieIcfgContainer [2018-11-28 18:09:04,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:09:04,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:09:04,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:09:04,956 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:09:04,957 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:09:00" (3/4) ... [2018-11-28 18:09:04,959 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:09:05,010 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:09:05,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:09:05,011 INFO L168 Benchmark]: Toolchain (without parser) took 5859.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.7 MB in the beginning and 855.2 MB in the end (delta: 97.4 MB). Peak memory consumption was 240.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:09:05,012 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:09:05,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:09:05,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.69 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:09:05,014 INFO L168 Benchmark]: Boogie Preprocessor took 44.04 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. [2018-11-28 18:09:05,014 INFO L168 Benchmark]: RCFGBuilder took 603.38 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.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:09:05,015 INFO L168 Benchmark]: TraceAbstraction took 4424.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.2 MB in the end (delta: 236.3 MB). Peak memory consumption was 236.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:09:05,016 INFO L168 Benchmark]: Witness Printer took 54.53 ms. Allocated memory is still 1.2 GB. Free memory is still 855.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:09:05,020 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.63 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 687.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.69 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.04 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 603.38 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.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4424.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.2 MB in the end (delta: 236.3 MB). Peak memory consumption was 236.3 MB. Max. memory is 11.5 GB. * Witness Printer took 54.53 ms. Allocated memory is still 1.2 GB. Free memory is still 855.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={11:0}, end->next={0:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 3 error locations. UNSAFE Result, 4.3s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 220 SDslu, 326 SDs, 0 SdLazy, 253 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, 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, 5 MinimizatonAttempts, 93 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 82 ConstructedInterpolants, 6 QuantifiedInterpolants, 8452 SizeOfPredicates, 10 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...