./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 2e94e6aa 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-2e94e6a [2018-12-31 04:25:44,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:25:44,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:25:44,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:25:44,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:25:44,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:25:44,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:25:44,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:25:44,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:25:44,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:25:44,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:25:44,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:25:44,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:25:44,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:25:44,184 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:25:44,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:25:44,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:25:44,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:25:44,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:25:44,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:25:44,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:25:44,210 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:25:44,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:25:44,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:25:44,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:25:44,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:25:44,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:25:44,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:25:44,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:25:44,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:25:44,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:25:44,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:25:44,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:25:44,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:25:44,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:25:44,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:25:44,228 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:25:44,259 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:25:44,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:25:44,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:25:44,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:25:44,261 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:25:44,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:25:44,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:25:44,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:25:44,262 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:25:44,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:25:44,262 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:25:44,262 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:25:44,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:25:44,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:25:44,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:25:44,263 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:25:44,263 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:25:44,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:25:44,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:25:44,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:25:44,264 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:25:44,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:25:44,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:25:44,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:25:44,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:25:44,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:25:44,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:25:44,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:25:44,265 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-12-31 04:25:44,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:25:44,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:25:44,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:25:44,326 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:25:44,328 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:25:44,330 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-12-31 04:25:44,392 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ed82bea/e9f2922ffa09452eac26d3263eb22f99/FLAGb2d023d30 [2018-12-31 04:25:44,949 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:25:44,950 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-31 04:25:44,965 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ed82bea/e9f2922ffa09452eac26d3263eb22f99/FLAGb2d023d30 [2018-12-31 04:25:45,192 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ed82bea/e9f2922ffa09452eac26d3263eb22f99 [2018-12-31 04:25:45,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:25:45,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:25:45,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:25:45,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:25:45,202 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:25:45,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704d4b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45, skipping insertion in model container [2018-12-31 04:25:45,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:25:45,263 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:25:45,651 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:25:45,675 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:25:45,825 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:25:45,882 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:25:45,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45 WrapperNode [2018-12-31 04:25:45,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:25:45,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:25:45,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:25:45,884 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:25:45,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:25:45,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:25:45,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:25:45,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:25:45,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (1/1) ... [2018-12-31 04:25:45,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:25:45,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:25:45,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:25:45,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:25:45,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (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-12-31 04:25:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:25:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:25:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 04:25:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 04:25:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 04:25:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:25:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:25:46,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:25:46,644 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:25:46,645 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-12-31 04:25:46,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:46 BoogieIcfgContainer [2018-12-31 04:25:46,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:25:46,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:25:46,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:25:46,650 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:25:46,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:25:45" (1/3) ... [2018-12-31 04:25:46,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1bc0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:25:46, skipping insertion in model container [2018-12-31 04:25:46,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:45" (2/3) ... [2018-12-31 04:25:46,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1bc0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:25:46, skipping insertion in model container [2018-12-31 04:25:46,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:46" (3/3) ... [2018-12-31 04:25:46,653 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-31 04:25:46,663 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:25:46,673 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 04:25:46,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 04:25:46,719 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:25:46,720 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:25:46,720 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:25:46,720 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:25:46,722 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:25:46,722 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:25:46,722 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:25:46,722 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:25:46,722 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:25:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-31 04:25:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-31 04:25:46,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:46,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-31 04:25:46,751 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2018-12-31 04:25:46,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:46,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:46,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:46,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:46,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:46,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:25:46,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:25:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:25:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:25:46,926 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-12-31 04:25:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:46,944 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2018-12-31 04:25:46,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:25:46,946 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2018-12-31 04:25:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:46,956 INFO L225 Difference]: With dead ends: 53 [2018-12-31 04:25:46,956 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 04:25:46,960 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-12-31 04:25:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 04:25:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 04:25:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 04:25:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-31 04:25:46,993 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2018-12-31 04:25:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:46,994 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-31 04:25:46,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:25:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-31 04:25:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-31 04:25:46,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:46,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:46,995 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2018-12-31 04:25:46,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:46,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:46,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:47,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:47,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:25:47,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:25:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:25:47,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:47,122 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2018-12-31 04:25:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:47,387 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-31 04:25:47,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:25:47,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-31 04:25:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:47,389 INFO L225 Difference]: With dead ends: 31 [2018-12-31 04:25:47,389 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 04:25:47,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 04:25:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-12-31 04:25:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 04:25:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-12-31 04:25:47,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2018-12-31 04:25:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:47,401 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-12-31 04:25:47,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:25:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-12-31 04:25:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:25:47,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:47,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:47,403 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2018-12-31 04:25:47,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:47,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:47,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:47,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:47,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:47,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:25:47,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:25:47,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:25:47,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:47,609 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2018-12-31 04:25:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:47,818 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-12-31 04:25:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:25:47,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 04:25:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:47,821 INFO L225 Difference]: With dead ends: 47 [2018-12-31 04:25:47,821 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 04:25:47,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:25:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 04:25:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-12-31 04:25:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 04:25:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-31 04:25:47,830 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2018-12-31 04:25:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:47,830 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-31 04:25:47,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:25:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-31 04:25:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 04:25:47,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:47,832 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:47,833 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2018-12-31 04:25:47,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:47,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:47,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:48,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:25:48,358 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-12-31 04:25:48,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:48,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:25:48,493 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-12-31 04:25:48,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:48,559 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-12-31 04:25:48,576 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-12-31 04:25:48,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:48,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:48,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:48,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-12-31 04:25:48,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:48,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:48,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-12-31 04:25:48,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:48,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:48,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:49,032 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-12-31 04:25:49,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:49,045 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-12-31 04:25:49,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,081 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-12-31 04:25:49,095 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-12-31 04:25:49,095 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,102 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,110 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,132 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-12-31 04:25:49,132 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2018-12-31 04:25:49,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:49,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:49,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:49,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 04:25:49,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-31 04:25:49,249 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-31 04:25:49,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:49,267 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 20 treesize of output 16 [2018-12-31 04:25:49,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,320 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:49,324 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:49,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2018-12-31 04:25:49,383 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-31 04:25:49,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:49,399 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-12-31 04:25:49,400 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,411 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,429 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:49,471 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:80, output treesize:43 [2018-12-31 04:25:49,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-12-31 04:25:49,646 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-12-31 04:25:49,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,724 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-12-31 04:25:49,724 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,734 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-12-31 04:25:49,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:49,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-12-31 04:25:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:49,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:25:49,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-12-31 04:25:49,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 04:25:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 04:25:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:25:49,795 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2018-12-31 04:25:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:50,554 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-12-31 04:25:50,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:25:50,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-12-31 04:25:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:50,557 INFO L225 Difference]: With dead ends: 60 [2018-12-31 04:25:50,557 INFO L226 Difference]: Without dead ends: 58 [2018-12-31 04:25:50,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-12-31 04:25:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-31 04:25:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 19. [2018-12-31 04:25:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 04:25:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-31 04:25:50,564 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2018-12-31 04:25:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:50,564 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-31 04:25:50,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 04:25:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-12-31 04:25:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:25:50,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:50,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:50,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash -839217458, now seen corresponding path program 1 times [2018-12-31 04:25:50,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:50,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:50,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:50,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:50,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:50,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:50,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:25:50,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:25:50,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:25:50,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:50,688 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2018-12-31 04:25:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:50,767 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-31 04:25:50,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:25:50,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-31 04:25:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:50,774 INFO L225 Difference]: With dead ends: 35 [2018-12-31 04:25:50,774 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 04:25:50,774 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-12-31 04:25:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 04:25:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-12-31 04:25:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 04:25:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-12-31 04:25:50,779 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2018-12-31 04:25:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:50,779 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-12-31 04:25:50,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:25:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-12-31 04:25:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:25:50,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:50,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:50,780 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash -839157876, now seen corresponding path program 1 times [2018-12-31 04:25:50,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:50,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:50,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:50,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:50,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:25:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:25:50,831 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:25:50,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:25:50 BoogieIcfgContainer [2018-12-31 04:25:50,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:25:50,861 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:25:50,861 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:25:50,861 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:25:50,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:46" (3/4) ... [2018-12-31 04:25:50,864 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 04:25:50,909 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:25:50,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:25:50,910 INFO L168 Benchmark]: Toolchain (without parser) took 5713.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.0 MB in the beginning and 872.0 MB in the end (delta: 74.0 MB). Peak memory consumption was 222.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:50,911 INFO L168 Benchmark]: CDTParser took 0.96 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-12-31 04:25:50,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:50,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.12 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-12-31 04:25:50,914 INFO L168 Benchmark]: Boogie Preprocessor took 41.49 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-12-31 04:25:50,914 INFO L168 Benchmark]: RCFGBuilder took 661.61 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:50,915 INFO L168 Benchmark]: TraceAbstraction took 4214.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.8 MB in the end (delta: 224.4 MB). Peak memory consumption was 224.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:50,915 INFO L168 Benchmark]: Witness Printer took 48.20 ms. Allocated memory is still 1.2 GB. Free memory was 878.8 MB in the beginning and 872.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:50,922 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.96 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 685.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.12 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. * Boogie Preprocessor took 41.49 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 661.61 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4214.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.8 MB in the end (delta: 224.4 MB). Peak memory consumption was 224.4 MB. Max. memory is 11.5 GB. * Witness Printer took 48.20 ms. Allocated memory is still 1.2 GB. Free memory was 878.8 MB in the beginning and 872.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. 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; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list [L1027] COND FALSE !(!(((void*)0) != end)) [L1028] EXPR end->colour [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 3 error locations. UNSAFE Result, 4.1s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 150 SDslu, 204 SDs, 0 SdLazy, 207 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, 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, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 6 QuantifiedInterpolants, 7440 SizeOfPredicates, 11 NumberOfNonLiveVariables, 83 ConjunctsInSsa, 32 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...