./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.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-sentinel_false-unreach-call_false-valid-memcleanup.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 d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12 09:36:09,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:36:09,107 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:36:09,119 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:36:09,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:36:09,121 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:36:09,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:36:09,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:36:09,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:36:09,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:36:09,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:36:09,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:36:09,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:36:09,130 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:36:09,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:36:09,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:36:09,133 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:36:09,135 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:36:09,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:36:09,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:36:09,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:36:09,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:36:09,145 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:36:09,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:36:09,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:36:09,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:36:09,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:36:09,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:36:09,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:36:09,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:36:09,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:36:09,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:36:09,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:36:09,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:36:09,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:36:09,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:36:09,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:36:09,170 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:36:09,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:36:09,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:36:09,172 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:36:09,172 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:36:09,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:36:09,172 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:36:09,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:36:09,173 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:36:09,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:36:09,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:36:09,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:36:09,174 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:36:09,174 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:36:09,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:36:09,175 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:36:09,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:36:09,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:36:09,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:36:09,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:36:09,176 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:36:09,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:36:09,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:36:09,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:36:09,177 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:36:09,177 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:36:09,177 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:36:09,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:36:09,179 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 -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2019-01-12 09:36:09,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:36:09,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:36:09,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:36:09,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:36:09,259 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:36:09,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:36:09,320 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7ad8b49/46e8bc4f630f4b13935284daeb998421/FLAG9df3abc1b [2019-01-12 09:36:09,888 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:36:09,888 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:36:09,909 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7ad8b49/46e8bc4f630f4b13935284daeb998421/FLAG9df3abc1b [2019-01-12 09:36:10,108 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7ad8b49/46e8bc4f630f4b13935284daeb998421 [2019-01-12 09:36:10,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:36:10,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:36:10,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:36:10,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:36:10,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:36:10,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7730cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10, skipping insertion in model container [2019-01-12 09:36:10,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:36:10,191 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:36:10,520 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:36:10,531 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:36:10,653 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:36:10,723 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:36:10,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10 WrapperNode [2019-01-12 09:36:10,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:36:10,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:36:10,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:36:10,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:36:10,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:36:10,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:36:10,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:36:10,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:36:10,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (1/1) ... [2019-01-12 09:36:10,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:36:10,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:36:10,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:36:10,812 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:36:10,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36: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-12 09:36:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:36:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:36:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 09:36:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:36:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:36:10,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:36:10,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:36:10,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:36:11,433 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:36:11,433 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-12 09:36:11,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:36:11 BoogieIcfgContainer [2019-01-12 09:36:11,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:36:11,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:36:11,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:36:11,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:36:11,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:36:10" (1/3) ... [2019-01-12 09:36:11,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1858a732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:36:11, skipping insertion in model container [2019-01-12 09:36:11,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:36:10" (2/3) ... [2019-01-12 09:36:11,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1858a732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:36:11, skipping insertion in model container [2019-01-12 09:36:11,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:36:11" (3/3) ... [2019-01-12 09:36:11,441 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:36:11,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:36:11,458 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-12 09:36:11,477 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-12 09:36:11,509 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:36:11,510 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:36:11,510 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:36:11,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:36:11,511 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:36:11,511 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:36:11,511 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:36:11,511 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:36:11,511 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:36:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-01-12 09:36:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 09:36:11,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:11,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 09:36:11,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2019-01-12 09:36:11,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:11,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:11,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:11,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:11,698 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-12 09:36:11,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:36:11,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:36:11,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:36:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:36:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:36:11,718 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-01-12 09:36:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:11,734 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2019-01-12 09:36:11,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:36:11,735 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-01-12 09:36:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:11,744 INFO L225 Difference]: With dead ends: 61 [2019-01-12 09:36:11,744 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 09:36:11,747 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-12 09:36:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 09:36:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 09:36:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:36:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-01-12 09:36:11,775 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2019-01-12 09:36:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:11,775 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-01-12 09:36:11,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:36:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-01-12 09:36:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 09:36:11,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:11,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:11,777 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2019-01-12 09:36:11,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:11,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:11,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:11,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:11,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:11,951 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-12 09:36:11,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:36:11,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:36:11,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:36:11,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:36:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:36:11,956 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-01-12 09:36:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:12,246 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-01-12 09:36:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:36:12,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 09:36:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:12,248 INFO L225 Difference]: With dead ends: 33 [2019-01-12 09:36:12,248 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 09:36:12,249 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 [2019-01-12 09:36:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 09:36:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-01-12 09:36:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:36:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-12 09:36:12,254 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2019-01-12 09:36:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:12,254 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-12 09:36:12,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:36:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-01-12 09:36:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:36:12,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:12,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:12,256 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:12,256 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2019-01-12 09:36:12,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:12,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:12,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:12,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:12,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:12,417 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-12 09:36:12,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:36:12,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:36:12,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:36:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:36:12,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:36:12,421 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-01-12 09:36:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:12,658 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-01-12 09:36:12,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:36:12,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 09:36:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:12,660 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:36:12,660 INFO L226 Difference]: Without dead ends: 48 [2019-01-12 09:36:12,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:36:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-12 09:36:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-01-12 09:36:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:36:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-01-12 09:36:12,670 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2019-01-12 09:36:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:12,670 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-12 09:36:12,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:36:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-01-12 09:36:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:36:12,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:12,672 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:12,672 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2019-01-12 09:36:12,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:12,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:13,000 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-01-12 09:36:13,177 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-12 09:36:13,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:36:13,178 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-12 09:36:13,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:13,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:36:13,292 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 9 treesize of output 12 [2019-01-12 09:36:13,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2019-01-12 09:36:13,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,473 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-12 09:36: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 10 treesize of output 9 [2019-01-12 09:36:13,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:13,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:29 [2019-01-12 09:36:13,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:13,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:13,759 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-12 09:36:13,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,797 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-12 09:36:13,803 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-12 09:36:13,831 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-12 09:36:13,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:13,844 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-12 09:36:13,845 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,925 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-12 09:36:13,930 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-12 09:36:13,931 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,945 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,964 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-12 09:36:13,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:13,981 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-01-12 09:36:14,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:14,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:14,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:14,060 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-12 09:36:14,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,100 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-12 09:36:14,116 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-12 09:36:14,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:14,179 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:14,214 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2019-01-12 09:36:14,223 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-12 09:36:14,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:14,247 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-12 09:36:14,248 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,256 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,302 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 40 treesize of output 49 [2019-01-12 09:36:14,314 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 11 treesize of output 14 [2019-01-12 09:36:14,323 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 14 treesize of output 15 [2019-01-12 09:36:14,324 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,334 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,379 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,394 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:14,428 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:78, output treesize:41 [2019-01-12 09:36:14,614 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 31 treesize of output 35 [2019-01-12 09:36:14,634 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-12 09:36:14,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,710 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-12 09:36:14,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,720 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 5 treesize of output 1 [2019-01-12 09:36:14,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:14,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2019-01-12 09:36:14,734 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-12 09:36:14,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:36:14,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-01-12 09:36:14,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:36:14,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:36:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:36:14,763 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2019-01-12 09:36:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:15,403 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-01-12 09:36:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:36:15,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-01-12 09:36:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:15,406 INFO L225 Difference]: With dead ends: 58 [2019-01-12 09:36:15,406 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 09:36:15,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-12 09:36:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 09:36:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 23. [2019-01-12 09:36:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:36:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-12 09:36:15,413 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2019-01-12 09:36:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:15,413 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-12 09:36:15,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:36:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-01-12 09:36:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:36:15,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:15,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:15,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1689639521, now seen corresponding path program 1 times [2019-01-12 09:36:15,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:15,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:15,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:15,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:15,523 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-12 09:36:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:36:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:36:15,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:36:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:36:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:36:15,525 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-01-12 09:36:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:15,610 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-01-12 09:36:15,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:36:15,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-12 09:36:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:15,613 INFO L225 Difference]: With dead ends: 38 [2019-01-12 09:36:15,613 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:36:15,614 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-12 09:36:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:36:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-12 09:36:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:36:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-12 09:36:15,620 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2019-01-12 09:36:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:15,621 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-12 09:36:15,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:36:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-01-12 09:36:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:36:15,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:15,622 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:15,622 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2084817261, now seen corresponding path program 1 times [2019-01-12 09:36:15,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:15,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:15,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:36:15,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:36:15,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:36:15,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:15,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:36:15,830 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 09:36:15,841 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 8 treesize of output 7 [2019-01-12 09:36:15,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:15,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 42 [2019-01-12 09:36:15,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 34 [2019-01-12 09:36:15,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:15,957 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 28 treesize of output 20 [2019-01-12 09:36:15,957 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:16,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2019-01-12 09:36:16,026 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-12 09:36:16,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:36:16,147 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 27 treesize of output 29 [2019-01-12 09:36:16,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:16,156 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 22 treesize of output 14 [2019-01-12 09:36:16,157 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,168 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:36:16,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:36:16,327 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 09:36:16,333 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 8 treesize of output 7 [2019-01-12 09:36:16,334 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 42 [2019-01-12 09:36:16,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-01-12 09:36:16,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:16,382 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 22 treesize of output 14 [2019-01-12 09:36:16,382 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,443 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 34 [2019-01-12 09:36:16,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:16,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2019-01-12 09:36:16,512 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-12 09:36:16,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:16,551 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 28 treesize of output 20 [2019-01-12 09:36:16,552 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,578 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:36:16,605 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:36:16,629 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:36:16,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2019-01-12 09:36:16,682 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:77, output treesize:216 [2019-01-12 09:36:16,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2019-01-12 09:36:16,854 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 41 treesize of output 36 [2019-01-12 09:36:16,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,935 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 36 treesize of output 29 [2019-01-12 09:36:16,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:16,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2019-01-12 09:36:16,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-12 09:36:17,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:36:17,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-01-12 09:36:17,112 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 26 treesize of output 19 [2019-01-12 09:36:17,113 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,139 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 19 treesize of output 14 [2019-01-12 09:36:17,140 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-01-12 09:36:17,403 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-12 09:36:17,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:36:17,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-01-12 09:36:17,477 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-12 09:36:17,477 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,501 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 5 treesize of output 1 [2019-01-12 09:36:17,502 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,507 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2019-01-12 09:36:17,535 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 29 treesize of output 24 [2019-01-12 09:36:17,535 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 15 [2019-01-12 09:36:17,561 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2019-01-12 09:36:17,584 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,596 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-01-12 09:36:17,658 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 15 treesize of output 3 [2019-01-12 09:36:17,659 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,665 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-12 09:36:17,713 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 15 treesize of output 3 [2019-01-12 09:36:17,714 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,717 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:17,743 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:110, output treesize:7 [2019-01-12 09:36:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:36:17,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:36:17,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-12 09:36:17,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:36:17,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:36:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:36:17,783 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-01-12 09:36:17,923 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-12 09:36:18,296 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-01-12 09:36:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:18,328 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-12 09:36:18,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:36:18,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-12 09:36:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:18,330 INFO L225 Difference]: With dead ends: 49 [2019-01-12 09:36:18,330 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 09:36:18,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:36:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 09:36:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 09:36:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:36:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-01-12 09:36:18,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-01-12 09:36:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:18,337 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-01-12 09:36:18,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:36:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-01-12 09:36:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:36:18,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:18,338 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:18,338 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1088473273, now seen corresponding path program 1 times [2019-01-12 09:36:18,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:18,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:18,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:18,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:18,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:18,550 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2019-01-12 09:36:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:36:18,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:36:18,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:36:18,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:18,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:36:18,813 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 9 treesize of output 12 [2019-01-12 09:36:18,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2019-01-12 09:36:18,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:18,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:18,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:18,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-01-12 09:36:18,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:18,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:18,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:18,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-01-12 09:36:18,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:18,931 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 27 treesize of output 20 [2019-01-12 09:36:18,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:36:18,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:18,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-12 09:36:18,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-01-12 09:36:18,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:18,980 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:18,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,013 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 27 treesize of output 20 [2019-01-12 09:36:19,019 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 8 treesize of output 7 [2019-01-12 09:36:19,019 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-12 09:36:19,056 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 11 [2019-01-12 09:36:19,057 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,063 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,074 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,099 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:79, output treesize:59 [2019-01-12 09:36:19,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:19,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:19,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:19,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:19,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2019-01-12 09:36:19,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,294 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-12 09:36:19,300 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-12 09:36:19,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:19,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 169 [2019-01-12 09:36:19,534 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2019-01-12 09:36:19,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-01-12 09:36:19,608 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2019-01-12 09:36:19,647 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,665 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 158 [2019-01-12 09:36:19,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-12 09:36:19,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:19,741 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 22 treesize of output 14 [2019-01-12 09:36:19,742 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,748 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,785 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,811 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-12 09:36:19,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 92 [2019-01-12 09:36:19,883 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 77 treesize of output 62 [2019-01-12 09:36:19,884 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,916 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:19,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2019-01-12 09:36:20,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 34 [2019-01-12 09:36:20,027 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:20,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 66 [2019-01-12 09:36:20,090 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 27 treesize of output 30 [2019-01-12 09:36:20,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:20,136 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 30 treesize of output 45 [2019-01-12 09:36:20,137 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,148 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,163 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,172 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:20,197 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:229, output treesize:79 [2019-01-12 09:36:20,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:36:20,332 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-12 09:36:20,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:20,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:82 [2019-01-12 09:36:20,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 48 [2019-01-12 09:36:20,512 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 5 treesize of output 1 [2019-01-12 09:36:20,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2019-01-12 09:36:20,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-01-12 09:36:20,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:20,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:4 [2019-01-12 09:36:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:36:20,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:36:20,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-01-12 09:36:20,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 09:36:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 09:36:20,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-01-12 09:36:20,720 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 15 states. [2019-01-12 09:36:20,964 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-01-12 09:36:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:21,924 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-01-12 09:36:21,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 09:36:21,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-01-12 09:36:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:21,926 INFO L225 Difference]: With dead ends: 84 [2019-01-12 09:36:21,926 INFO L226 Difference]: Without dead ends: 82 [2019-01-12 09:36:21,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-01-12 09:36:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-12 09:36:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 42. [2019-01-12 09:36:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 09:36:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-01-12 09:36:21,938 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2019-01-12 09:36:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:21,939 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-01-12 09:36:21,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 09:36:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-01-12 09:36:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:36:21,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:21,940 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:21,940 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash -67404919, now seen corresponding path program 1 times [2019-01-12 09:36:21,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:21,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:21,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:21,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:21,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:36:22,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:36:22,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:36:22,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:36:22,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:36:22,308 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 9 treesize of output 12 [2019-01-12 09:36:22,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2019-01-12 09:36:22,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:22,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2019-01-12 09:36:22,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:22,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:22,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-12 09:36:22,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,588 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 27 treesize of output 20 [2019-01-12 09:36:22,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-01-12 09:36:22,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,609 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 19 treesize of output 20 [2019-01-12 09:36:22,616 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 8 treesize of output 7 [2019-01-12 09:36:22,616 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,646 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 27 treesize of output 20 [2019-01-12 09:36:22,649 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 8 treesize of output 7 [2019-01-12 09:36:22,650 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,661 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 19 treesize of output 24 [2019-01-12 09:36:22,665 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 11 [2019-01-12 09:36:22,665 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,670 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,675 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,686 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-12 09:36:22,686 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:68, output treesize:33 [2019-01-12 09:36:22,721 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2019-01-12 09:36:22,725 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 20 treesize of output 1 [2019-01-12 09:36:22,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,756 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 46 treesize of output 41 [2019-01-12 09:36:22,761 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 26 treesize of output 11 [2019-01-12 09:36:22,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,782 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2019-01-12 09:36:22,784 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 11 [2019-01-12 09:36:22,784 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,795 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:100, output treesize:38 [2019-01-12 09:36:22,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2019-01-12 09:36:22,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 30 treesize of output 19 [2019-01-12 09:36:22,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-12 09:36:22,871 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-12 09:36:22,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:11 [2019-01-12 09:36:22,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:36:22,909 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-12 09:36:22,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:22,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-12 09:36:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:36:22,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:36:22,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-01-12 09:36:22,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 09:36:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 09:36:22,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:36:22,950 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 18 states. [2019-01-12 09:36:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:24,069 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-01-12 09:36:24,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:36:24,070 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-01-12 09:36:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:24,077 INFO L225 Difference]: With dead ends: 83 [2019-01-12 09:36:24,077 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:36:24,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-01-12 09:36:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:36:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-01-12 09:36:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 09:36:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-01-12 09:36:24,090 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 20 [2019-01-12 09:36:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:24,090 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-12 09:36:24,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 09:36:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-01-12 09:36:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:36:24,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:24,094 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:24,095 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash 299800945, now seen corresponding path program 1 times [2019-01-12 09:36:24,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:36:24,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:36:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:24,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:36:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:36:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:36:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:36:24,177 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:36:24,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:36:24 BoogieIcfgContainer [2019-01-12 09:36:24,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:36:24,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:36:24,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:36:24,220 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:36:24,223 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:36:11" (3/4) ... [2019-01-12 09:36:24,225 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:36:24,292 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:36:24,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:36:24,297 INFO L168 Benchmark]: Toolchain (without parser) took 14183.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 946.0 MB in the beginning and 909.1 MB in the end (delta: 36.9 MB). Peak memory consumption was 330.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:36:24,299 INFO L168 Benchmark]: CDTParser took 0.17 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. [2019-01-12 09:36:24,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:36:24,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.25 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-12 09:36:24,300 INFO L168 Benchmark]: Boogie Preprocessor took 35.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:36:24,300 INFO L168 Benchmark]: RCFGBuilder took 623.01 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.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:36:24,300 INFO L168 Benchmark]: TraceAbstraction took 12784.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 909.1 MB in the end (delta: 178.1 MB). Peak memory consumption was 328.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:36:24,303 INFO L168 Benchmark]: Witness Printer took 75.93 ms. Allocated memory is still 1.3 GB. Free memory is still 909.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:36:24,305 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 608.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.25 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 35.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 623.01 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.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12784.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 909.1 MB in the end (delta: 178.1 MB). Peak memory consumption was 328.1 MB. Max. memory is 11.5 GB. * Witness Printer took 75.93 ms. Allocated memory is still 1.3 GB. Free memory is still 909.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list [L1030] COND FALSE !(!(null != end)) [L1031] EXPR end->colour [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) [L1039] EXPR end->colour [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 4 error locations. UNSAFE Result, 12.7s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 315 SDslu, 779 SDs, 0 SdLazy, 863 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, 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, 8 MinimizatonAttempts, 114 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 165 ConstructedInterpolants, 19 QuantifiedInterpolants, 72342 SizeOfPredicates, 52 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 2/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...