./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 0ed9222f 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-0ed9222-m [2019-01-14 15:52:08,822 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:52:08,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:52:08,842 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:52:08,844 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:52:08,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:52:08,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:52:08,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:52:08,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:52:08,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:52:08,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:52:08,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:52:08,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:52:08,863 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:52:08,864 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:52:08,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:52:08,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:52:08,874 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:52:08,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:52:08,879 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:52:08,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:52:08,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:52:08,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:52:08,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:52:08,889 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:52:08,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:52:08,893 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:52:08,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:52:08,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:52:08,898 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:52:08,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:52:08,899 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:52:08,901 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:52:08,901 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:52:08,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:52:08,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:52:08,904 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:52:08,924 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:52:08,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:52:08,925 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:52:08,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:52:08,926 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:52:08,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:52:08,926 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:52:08,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:52:08,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:52:08,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:52:08,927 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:52:08,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:52:08,927 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:52:08,927 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:52:08,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:52:08,928 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:52:08,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:52:08,928 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:52:08,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:52:08,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:52:08,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:52:08,932 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:52:08,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:52:08,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:52:08,933 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:52:08,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:52:08,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:52:08,933 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 [2019-01-14 15:52:08,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:52:08,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:52:08,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:52:08,987 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:52:08,988 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:52:08,990 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 [2019-01-14 15:52:09,067 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f581553be/38eea7c9525b4c1c868f78a94808a476/FLAGde0004ade [2019-01-14 15:52:09,582 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:52:09,584 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-14 15:52:09,600 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f581553be/38eea7c9525b4c1c868f78a94808a476/FLAGde0004ade [2019-01-14 15:52:09,887 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f581553be/38eea7c9525b4c1c868f78a94808a476 [2019-01-14 15:52:09,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:52:09,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:52:09,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:52:09,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:52:09,896 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:52:09,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:52:09" (1/1) ... [2019-01-14 15:52:09,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3662ed3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:09, skipping insertion in model container [2019-01-14 15:52:09,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:52:09" (1/1) ... [2019-01-14 15:52:09,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:52:09,957 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:52:10,279 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:52:10,301 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:52:10,348 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:52:10,501 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:52:10,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10 WrapperNode [2019-01-14 15:52:10,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:52:10,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:52:10,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:52:10,504 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:52:10,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:52:10,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:52:10,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:52:10,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:52:10,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... [2019-01-14 15:52:10,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:52:10,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:52:10,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:52:10,596 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:52:10,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:52:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:52:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:52:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:52:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:52:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:52:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 15:52:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:52:10,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:52:11,164 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:52:11,164 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-14 15:52:11,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:52:11 BoogieIcfgContainer [2019-01-14 15:52:11,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:52:11,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:52:11,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:52:11,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:52:11,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:52:09" (1/3) ... [2019-01-14 15:52:11,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780374b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:52:11, skipping insertion in model container [2019-01-14 15:52:11,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:52:10" (2/3) ... [2019-01-14 15:52:11,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780374b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:52:11, skipping insertion in model container [2019-01-14 15:52:11,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:52:11" (3/3) ... [2019-01-14 15:52:11,175 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-14 15:52:11,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:52:11,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-14 15:52:11,219 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-14 15:52:11,244 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:52:11,245 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:52:11,245 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:52:11,245 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:52:11,245 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:52:11,246 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:52:11,246 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:52:11,246 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:52:11,246 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:52:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-01-14 15:52:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 15:52:11,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:52:11,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 15:52:11,271 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:52:11,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:52:11,275 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2019-01-14 15:52:11,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:52:11,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:52:11,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:11,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:52:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:52:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:52:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:52:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 15:52:11,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 15:52:11,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 15:52:11,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:52:11,425 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-01-14 15:52:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:52:11,440 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-01-14 15:52:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 15:52:11,441 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-01-14 15:52:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:52:11,449 INFO L225 Difference]: With dead ends: 53 [2019-01-14 15:52:11,450 INFO L226 Difference]: Without dead ends: 23 [2019-01-14 15:52:11,453 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 [2019-01-14 15:52:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-14 15:52:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 15:52:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 15:52:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-14 15:52:11,481 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2019-01-14 15:52:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:52:11,482 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-14 15:52:11,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 15:52:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-01-14 15:52:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 15:52:11,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:52:11,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:52:11,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:52:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:52:11,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2019-01-14 15:52:11,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:52:11,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:52:11,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:11,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:52:11,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:52:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:52:11,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:52:11,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:52:11,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:52:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:52:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:52:11,587 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2019-01-14 15:52:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:52:11,769 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-14 15:52:11,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:52:11,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-14 15:52:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:52:11,772 INFO L225 Difference]: With dead ends: 31 [2019-01-14 15:52:11,772 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 15:52:11,773 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 [2019-01-14 15:52:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 15:52:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2019-01-14 15:52:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 15:52:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-01-14 15:52:11,777 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2019-01-14 15:52:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:52:11,777 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-14 15:52:11,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:52:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-01-14 15:52:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 15:52:11,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:52:11,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:52:11,779 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:52:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:52:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2019-01-14 15:52:11,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:52:11,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:52:11,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:11,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:52:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:52:11,999 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-14 15:52:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:52:12,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:52:12,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:52:12,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:52:12,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:52:12,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:52:12,102 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-01-14 15:52:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:52:12,308 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-01-14 15:52:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:52:12,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-14 15:52:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:52:12,311 INFO L225 Difference]: With dead ends: 47 [2019-01-14 15:52:12,311 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 15:52:12,312 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 [2019-01-14 15:52:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 15:52:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2019-01-14 15:52:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 15:52:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-14 15:52:12,320 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2019-01-14 15:52:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:52:12,320 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-14 15:52:12,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:52:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-14 15:52:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 15:52:12,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:52:12,323 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:52:12,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:52:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:52:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2019-01-14 15:52:12,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:52:12,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:52:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:12,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:52:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:52:12,636 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-01-14 15:52:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:52:12,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:52:12,830 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 [2019-01-14 15:52:12,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:52:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:52:12,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:52:12,921 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 [2019-01-14 15:52:12,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:12,994 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 [2019-01-14 15:52:13,013 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 [2019-01-14 15:52:13,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,184 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-01-14 15:52:13,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:52:13,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:52:13,327 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 [2019-01-14 15:52:13,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:52:13,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:52:13,427 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 [2019-01-14 15:52:13,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:52:13,446 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 [2019-01-14 15:52:13,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,474 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 [2019-01-14 15:52:13,488 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 [2019-01-14 15:52:13,488 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,496 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,524 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. [2019-01-14 15:52:13,525 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2019-01-14 15:52:13,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:52:13,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:52:13,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:52:13,605 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 [2019-01-14 15:52:13,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,652 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 [2019-01-14 15:52:13,657 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 [2019-01-14 15:52:13,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:52:13,665 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 [2019-01-14 15:52:13,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,721 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:52:13,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:52:13,762 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 [2019-01-14 15:52:13,774 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 [2019-01-14 15:52:13,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:52:13,793 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 [2019-01-14 15:52:13,794 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,807 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,825 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:13,849 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. [2019-01-14 15:52:13,849 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:80, output treesize:43 [2019-01-14 15:52:14,029 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 [2019-01-14 15:52:14,049 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 [2019-01-14 15:52:14,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:14,121 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 [2019-01-14 15:52:14,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:14,135 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 [2019-01-14 15:52:14,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:52:14,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:14,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:52:14,148 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-01-14 15:52:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:52:14,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:52:14,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-01-14 15:52:14,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 15:52:14,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 15:52:14,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 15:52:14,184 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2019-01-14 15:52:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:52:14,887 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-01-14 15:52:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 15:52:14,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-01-14 15:52:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:52:14,890 INFO L225 Difference]: With dead ends: 60 [2019-01-14 15:52:14,891 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 15:52:14,892 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 [2019-01-14 15:52:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 15:52:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 19. [2019-01-14 15:52:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 15:52:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-14 15:52:14,898 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2019-01-14 15:52:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:52:14,900 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 15:52:14,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 15:52:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-01-14 15:52:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:52:14,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:52:14,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:52:14,901 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:52:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:52:14,902 INFO L82 PathProgramCache]: Analyzing trace with hash -839217458, now seen corresponding path program 1 times [2019-01-14 15:52:14,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:52:14,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:52:14,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:14,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:52:14,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:52:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:52:15,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:52:15,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:52:15,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:52:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:52:15,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:52:15,034 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-01-14 15:52:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:52:15,108 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-14 15:52:15,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:52:15,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-14 15:52:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:52:15,114 INFO L225 Difference]: With dead ends: 35 [2019-01-14 15:52:15,115 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 15:52:15,115 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 [2019-01-14 15:52:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 15:52:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-01-14 15:52:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 15:52:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-01-14 15:52:15,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2019-01-14 15:52:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:52:15,120 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-14 15:52:15,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:52:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-01-14 15:52:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:52:15,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:52:15,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:52:15,121 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:52:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:52:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash -839157876, now seen corresponding path program 1 times [2019-01-14 15:52:15,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:52:15,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:52:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:15,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:52:15,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:52:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:52:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:52:15,166 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:52:15,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:52:15 BoogieIcfgContainer [2019-01-14 15:52:15,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:52:15,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:52:15,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:52:15,195 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:52:15,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:52:11" (3/4) ... [2019-01-14 15:52:15,199 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:52:15,241 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:52:15,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:52:15,242 INFO L168 Benchmark]: Toolchain (without parser) took 5351.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 952.7 MB in the beginning and 860.9 MB in the end (delta: 91.8 MB). Peak memory consumption was 217.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:52:15,243 INFO L168 Benchmark]: CDTParser took 0.17 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. [2019-01-14 15:52:15,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:52:15,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.52 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:52:15,245 INFO L168 Benchmark]: Boogie Preprocessor took 34.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:52:15,247 INFO L168 Benchmark]: RCFGBuilder took 571.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:52:15,248 INFO L168 Benchmark]: TraceAbstraction took 4026.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.9 MB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:52:15,248 INFO L168 Benchmark]: Witness Printer took 45.91 ms. Allocated memory is still 1.2 GB. Free memory is still 860.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:52:15,253 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.17 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 610.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.52 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.80 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 571.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4026.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.9 MB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. * Witness Printer took 45.91 ms. Allocated memory is still 1.2 GB. Free memory is still 860.9 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; [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, 3.9s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.2s 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s 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...