./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-ext3-properties/sll_nondet_insert_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/list-ext3-properties/sll_nondet_insert_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 27142e71f3089c5c3b5bf4f358882e993f701ffc .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:35:54,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:35:54,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:35:54,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:35:54,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:35:54,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:35:54,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:35:54,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:35:54,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:35:54,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:35:54,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:35:54,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:35:54,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:35:54,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:35:54,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:35:54,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:35:54,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:35:54,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:35:54,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:35:54,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:35:54,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:35:54,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:35:54,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:35:54,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:35:54,410 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:35:54,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:35:54,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:35:54,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:35:54,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:35:54,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:35:54,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:35:54,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:35:54,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:35:54,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:35:54,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:35:54,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:35:54,418 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:35:54,435 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:35:54,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:35:54,436 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:35:54,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:35:54,436 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:35:54,437 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:35:54,437 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:35:54,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:35:54,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:35:54,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:35:54,438 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:35:54,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:35:54,438 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:35:54,438 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:35:54,438 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:35:54,439 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:35:54,439 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:35:54,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:35:54,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:35:54,439 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:35:54,440 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:35:54,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:35:54,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:35:54,440 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:35:54,440 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:35:54,440 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:35:54,441 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:35:54,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:35:54,441 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 -> 27142e71f3089c5c3b5bf4f358882e993f701ffc [2019-01-12 10:35:54,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:35:54,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:35:54,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:35:54,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:35:54,517 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:35:54,518 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2019-01-12 10:35:54,585 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec14d2078/11bab4e86ce348cbaf74b872ed1c0ce4/FLAGc5242caeb [2019-01-12 10:35:55,084 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:35:55,084 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2019-01-12 10:35:55,100 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec14d2078/11bab4e86ce348cbaf74b872ed1c0ce4/FLAGc5242caeb [2019-01-12 10:35:55,385 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec14d2078/11bab4e86ce348cbaf74b872ed1c0ce4 [2019-01-12 10:35:55,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:35:55,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:35:55,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:35:55,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:35:55,396 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:35:55,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:35:55" (1/1) ... [2019-01-12 10:35:55,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2819d062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:55, skipping insertion in model container [2019-01-12 10:35:55,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:35:55" (1/1) ... [2019-01-12 10:35:55,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:35:55,468 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:35:55,844 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:35:55,860 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:35:56,013 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:35:56,078 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:35:56,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56 WrapperNode [2019-01-12 10:35:56,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:35:56,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:35:56,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:35:56,079 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:35:56,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:35:56,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:35:56,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:35:56,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:35:56,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (1/1) ... [2019-01-12 10:35:56,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:35:56,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:35:56,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:35:56,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:35:56,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (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 10:35:56,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 10:35:56,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 10:35:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 10:35:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 10:35:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:35:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-12 10:35:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:35:56,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:35:57,145 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:35:57,146 INFO L286 CfgBuilder]: Removed 30 assue(true) statements. [2019-01-12 10:35:57,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:57 BoogieIcfgContainer [2019-01-12 10:35:57,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:35:57,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:35:57,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:35:57,151 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:35:57,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:35:55" (1/3) ... [2019-01-12 10:35:57,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3234be6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:35:57, skipping insertion in model container [2019-01-12 10:35:57,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:56" (2/3) ... [2019-01-12 10:35:57,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3234be6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:35:57, skipping insertion in model container [2019-01-12 10:35:57,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:57" (3/3) ... [2019-01-12 10:35:57,155 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2019-01-12 10:35:57,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:35:57,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:35:57,194 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:35:57,219 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:35:57,220 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:35:57,220 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:35:57,220 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:35:57,220 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:35:57,220 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:35:57,221 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:35:57,221 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:35:57,221 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:35:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-12 10:35:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 10:35:57,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:57,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:57,257 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1240059524, now seen corresponding path program 1 times [2019-01-12 10:35:57,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:57,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:57,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:57,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:57,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:57,381 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 10:35:57,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:35:57,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 10:35:57,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 10:35:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 10:35:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 10:35:57,408 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-01-12 10:35:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:57,430 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2019-01-12 10:35:57,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 10:35:57,432 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 10:35:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:57,443 INFO L225 Difference]: With dead ends: 89 [2019-01-12 10:35:57,443 INFO L226 Difference]: Without dead ends: 40 [2019-01-12 10:35:57,446 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 10:35:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-12 10:35:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-12 10:35:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 10:35:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-01-12 10:35:57,486 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-01-12 10:35:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:57,487 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-01-12 10:35:57,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 10:35:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-01-12 10:35:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 10:35:57,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:57,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:57,489 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1466688541, now seen corresponding path program 1 times [2019-01-12 10:35:57,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:57,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:57,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:57,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:57,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:57,690 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 10:35:57,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:35:57,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 10:35:57,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 10:35:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 10:35:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:35:57,694 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-01-12 10:35:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:57,963 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2019-01-12 10:35:57,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 10:35:57,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-01-12 10:35:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:57,966 INFO L225 Difference]: With dead ends: 82 [2019-01-12 10:35:57,966 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 10:35:57,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 10:35:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 10:35:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-01-12 10:35:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 10:35:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-01-12 10:35:57,977 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2019-01-12 10:35:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:57,977 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-01-12 10:35:57,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 10:35:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-01-12 10:35:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 10:35:57,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:57,979 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, 1, 1, 1, 1, 1] [2019-01-12 10:35:57,979 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:57,980 INFO L82 PathProgramCache]: Analyzing trace with hash -395195180, now seen corresponding path program 1 times [2019-01-12 10:35:57,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:57,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:58,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:35:58,130 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 10:35:58,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:58,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:35:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:58,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 10:35:58,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2019-01-12 10:35:58,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:35:58,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:35:58,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:35:58,339 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-01-12 10:35:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:58,946 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-01-12 10:35:58,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:35:58,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-01-12 10:35:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:58,952 INFO L225 Difference]: With dead ends: 84 [2019-01-12 10:35:58,952 INFO L226 Difference]: Without dead ends: 55 [2019-01-12 10:35:58,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:35:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-12 10:35:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-12 10:35:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 10:35:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-01-12 10:35:58,973 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2019-01-12 10:35:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:58,976 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-01-12 10:35:58,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:35:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-01-12 10:35:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 10:35:58,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:58,977 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:58,977 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1510946244, now seen corresponding path program 1 times [2019-01-12 10:35:58,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:58,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:58,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:58,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:58,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:59,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:35:59,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 10:35:59,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:35:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:35:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:35:59,218 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2019-01-12 10:35:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:59,751 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-01-12 10:35:59,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:35:59,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-12 10:35:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:59,753 INFO L225 Difference]: With dead ends: 70 [2019-01-12 10:35:59,753 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 10:35:59,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-12 10:35:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 10:35:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-01-12 10:35:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 10:35:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-01-12 10:35:59,763 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2019-01-12 10:35:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:59,763 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-01-12 10:35:59,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:35:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-01-12 10:35:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 10:35:59,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:59,765 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:59,765 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash -353652332, now seen corresponding path program 1 times [2019-01-12 10:35:59,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:59,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:59,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:59,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:35:59,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:35:59,917 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 10:35:59,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:59,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:36:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:36:00,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:36:00,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 10:36:00,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:36:00,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:36:00,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:36:00,177 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-01-12 10:36:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:36:00,614 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2019-01-12 10:36:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 10:36:00,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-12 10:36:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:36:00,616 INFO L225 Difference]: With dead ends: 102 [2019-01-12 10:36:00,616 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 10:36:00,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-01-12 10:36:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 10:36:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-01-12 10:36:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 10:36:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-01-12 10:36:00,644 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-01-12 10:36:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:36:00,644 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-01-12 10:36:00,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:36:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-01-12 10:36:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 10:36:00,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:36:00,647 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:36:00,647 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:36:00,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:36:00,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1806454861, now seen corresponding path program 2 times [2019-01-12 10:36:00,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:36:00,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:36:00,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:00,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:36:00,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:36:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:36:00,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:36:00,899 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 10:36:00,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:36:00,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:36:00,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:36:00,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:36:01,090 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 11 treesize of output 8 [2019-01-12 10:36:01,100 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 10:36:01,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:01,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:01,114 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 10:36:01,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-01-12 10:36:01,184 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 24 treesize of output 20 [2019-01-12 10:36:01,192 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 20 treesize of output 12 [2019-01-12 10:36:01,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:01,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:01,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 10:36:01,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-01-12 10:36:01,261 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2019-01-12 10:36:01,269 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 12 treesize of output 4 [2019-01-12 10:36:01,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:01,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:01,296 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 10:36:01,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2019-01-12 10:36:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:36:01,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:36:01,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-01-12 10:36:01,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 10:36:01,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 10:36:01,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:36:01,331 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2019-01-12 10:36:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:36:01,977 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-01-12 10:36:01,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 10:36:01,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-01-12 10:36:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:36:01,987 INFO L225 Difference]: With dead ends: 75 [2019-01-12 10:36:01,987 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 10:36:01,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-12 10:36:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 10:36:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-01-12 10:36:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-12 10:36:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-01-12 10:36:02,000 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-01-12 10:36:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:36:02,000 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-01-12 10:36:02,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 10:36:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-01-12 10:36:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 10:36:02,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:36:02,002 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:36:02,002 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:36:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:36:02,002 INFO L82 PathProgramCache]: Analyzing trace with hash 217180203, now seen corresponding path program 3 times [2019-01-12 10:36:02,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:36:02,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:36:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:02,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:36:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:36:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 10:36:02,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:36:02,746 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 10:36:02,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:36:02,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-12 10:36:02,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:36:02,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:36:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 10:36:03,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:36:03,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-01-12 10:36:03,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 10:36:03,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 10:36:03,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-01-12 10:36:03,042 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-01-12 10:36:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:36:03,832 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2019-01-12 10:36:03,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 10:36:03,832 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-01-12 10:36:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:36:03,834 INFO L225 Difference]: With dead ends: 213 [2019-01-12 10:36:03,834 INFO L226 Difference]: Without dead ends: 205 [2019-01-12 10:36:03,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-01-12 10:36:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-12 10:36:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-01-12 10:36:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-12 10:36:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-01-12 10:36:03,859 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2019-01-12 10:36:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:36:03,859 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-01-12 10:36:03,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 10:36:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-01-12 10:36:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 10:36:03,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:36:03,861 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:36:03,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:36:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:36:03,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1805693939, now seen corresponding path program 4 times [2019-01-12 10:36:03,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:36:03,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:36:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:03,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:36:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:36:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:36:04,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:36:04,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:36:04,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 10:36:04,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 10:36:04,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:36:04,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:36:04,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-12 10:36:04,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-01-12 10:36:04,722 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 11 treesize of output 8 [2019-01-12 10:36:04,733 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 10:36:04,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,822 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 11 treesize of output 8 [2019-01-12 10:36:04,825 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 10:36:04,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-01-12 10:36:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:36:04,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:36:04,874 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 10:36:04,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-01-12 10:36:04,949 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 10:36:04,953 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 10:36:04,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:04,992 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 10:36:04,994 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 10:36:04,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:05,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:05,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:05,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-01-12 10:36:05,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:36:05,226 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:36:05,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 119 [2019-01-12 10:36:05,275 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 73 [2019-01-12 10:36:05,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:36:05,495 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:36:05,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 60 [2019-01-12 10:36:05,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 10:36:05,644 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:36:05,645 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 0 case distinctions, treesize of input 82 treesize of output 88 [2019-01-12 10:36:05,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:05,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:36:05,768 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:36:05,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2019-01-12 10:36:05,771 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 10:36:05,860 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-12 10:36:05,862 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:36:05,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 63 treesize of output 53 [2019-01-12 10:36:05,960 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:36:06,089 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:36:06,091 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 0 case distinctions, treesize of input 76 treesize of output 82 [2019-01-12 10:36:06,092 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2019-01-12 10:36:06,246 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 10:36:06,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2019-01-12 10:36:06,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2019-01-12 10:36:06,464 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 40 treesize of output 33 [2019-01-12 10:36:06,465 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,505 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 0 case distinctions, treesize of input 36 treesize of output 29 [2019-01-12 10:36:06,506 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2019-01-12 10:36:06,561 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,598 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2019-01-12 10:36:06,626 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 52 treesize of output 43 [2019-01-12 10:36:06,627 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-01-12 10:36:06,714 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,798 INFO L267 ElimStorePlain]: Start of recursive call 15: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,818 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 60 treesize of output 44 [2019-01-12 10:36:06,828 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 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-12 10:36:06,828 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,864 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 0 case distinctions, treesize of input 13 treesize of output 11 [2019-01-12 10:36:06,865 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,931 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 16 treesize of output 7 [2019-01-12 10:36:06,932 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,940 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:06,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2019-01-12 10:36:06,958 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 52 treesize of output 39 [2019-01-12 10:36:06,960 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,005 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 0 case distinctions, treesize of input 48 treesize of output 41 [2019-01-12 10:36:07,006 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,047 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 41 treesize of output 19 [2019-01-12 10:36:07,048 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,108 INFO L267 ElimStorePlain]: Start of recursive call 22: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2019-01-12 10:36:07,129 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 44 treesize of output 37 [2019-01-12 10:36:07,129 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,169 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 37 treesize of output 30 [2019-01-12 10:36:07,170 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,211 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 30 treesize of output 23 [2019-01-12 10:36:07,211 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:36:07,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:36:07,253 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:36:07,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-12 10:36:07,256 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,294 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 26 treesize of output 19 [2019-01-12 10:36:07,295 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,311 INFO L267 ElimStorePlain]: Start of recursive call 26: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:36:07,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:36:07,363 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 4 variables, input treesize:127, output treesize:15 [2019-01-12 10:36:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:36:07,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:36:07,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-01-12 10:36:07,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 10:36:07,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 10:36:07,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=325, Unknown=8, NotChecked=0, Total=380 [2019-01-12 10:36:07,401 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2019-01-12 10:36:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:36:08,273 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-01-12 10:36:08,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 10:36:08,274 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-01-12 10:36:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:36:08,275 INFO L225 Difference]: With dead ends: 168 [2019-01-12 10:36:08,275 INFO L226 Difference]: Without dead ends: 158 [2019-01-12 10:36:08,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=539, Unknown=8, NotChecked=0, Total=650 [2019-01-12 10:36:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-12 10:36:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2019-01-12 10:36:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-12 10:36:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2019-01-12 10:36:08,301 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2019-01-12 10:36:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:36:08,302 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2019-01-12 10:36:08,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 10:36:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2019-01-12 10:36:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 10:36:08,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:36:08,305 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:36:08,305 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:36:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:36:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1169066102, now seen corresponding path program 1 times [2019-01-12 10:36:08,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:36:08,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:36:08,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:08,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:36:08,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:36:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 10:36:08,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:36:08,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:36:08,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:36:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:36:08,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:36:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 10:36:08,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:36:08,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-01-12 10:36:08,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 10:36:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 10:36:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:36:08,541 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2019-01-12 10:36:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:36:09,423 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-01-12 10:36:09,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 10:36:09,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-01-12 10:36:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:36:09,429 INFO L225 Difference]: With dead ends: 375 [2019-01-12 10:36:09,430 INFO L226 Difference]: Without dead ends: 289 [2019-01-12 10:36:09,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-01-12 10:36:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-12 10:36:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2019-01-12 10:36:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-12 10:36:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2019-01-12 10:36:09,458 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2019-01-12 10:36:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:36:09,458 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2019-01-12 10:36:09,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 10:36:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2019-01-12 10:36:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 10:36:09,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:36:09,463 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:36:09,464 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:36:09,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:36:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1846037516, now seen corresponding path program 1 times [2019-01-12 10:36:09,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:36:09,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:36:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:09,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:36:09,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:36:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 10:36:10,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:36:10,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:36:10,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:36:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:36:10,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:36:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 10:36:10,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 10:36:10,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-01-12 10:36:10,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 10:36:10,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 10:36:10,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 10:36:10,193 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 9 states. [2019-01-12 10:36:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:36:10,831 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-01-12 10:36:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 10:36:10,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-01-12 10:36:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:36:10,835 INFO L225 Difference]: With dead ends: 273 [2019-01-12 10:36:10,835 INFO L226 Difference]: Without dead ends: 241 [2019-01-12 10:36:10,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-12 10:36:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-12 10:36:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-01-12 10:36:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-12 10:36:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2019-01-12 10:36:10,858 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2019-01-12 10:36:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:36:10,859 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2019-01-12 10:36:10,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 10:36:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2019-01-12 10:36:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 10:36:10,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:36:10,860 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:36:10,860 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:36:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:36:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902770, now seen corresponding path program 1 times [2019-01-12 10:36:10,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:36:10,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:36:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:36:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:36:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:36:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:36:10,945 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 10:36:10,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:36:10 BoogieIcfgContainer [2019-01-12 10:36:10,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:36:10,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:36:10,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:36:10,998 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:36:11,000 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:57" (3/4) ... [2019-01-12 10:36:11,004 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 10:36:11,100 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:36:11,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:36:11,102 INFO L168 Benchmark]: Toolchain (without parser) took 15712.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 952.7 MB in the beginning and 945.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 301.6 MB. Max. memory is 11.5 GB. [2019-01-12 10:36:11,106 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:36:11,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-01-12 10:36:11,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:36:11,107 INFO L168 Benchmark]: Boogie Preprocessor took 72.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:36:11,111 INFO L168 Benchmark]: RCFGBuilder took 908.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2019-01-12 10:36:11,111 INFO L168 Benchmark]: TraceAbstraction took 13849.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 102.8 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. [2019-01-12 10:36:11,112 INFO L168 Benchmark]: Witness Printer took 102.73 ms. Allocated memory is still 1.3 GB. Free memory was 955.0 MB in the beginning and 945.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-01-12 10:36:11,119 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 686.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 908.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13849.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 102.8 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. * Witness Printer took 102.73 ms. Allocated memory is still 1.3 GB. Free memory was 955.0 MB in the beginning and 945.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); [L564] SLL head = ((void *)0); [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND FALSE !(len-- > 0) [L573] return head; [L617] SLL s = sll_create(len); [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) [L576] int len = 0; [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) [L581] return len; [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. UNSAFE Result, 13.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 1659 SDslu, 2539 SDs, 0 SdLazy, 1207 SolverSat, 173 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 227 SyntacticMatches, 9 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=10, 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 441 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 588 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 533 ConstructedInterpolants, 3 QuantifiedInterpolants, 123727 SizeOfPredicates, 77 NumberOfNonLiveVariables, 1115 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 87/138 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...