./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product36_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product36_false-unreach-call_false-termination.cil.c -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 8094c843e4d897e4501a7b90ca3369f741555e9e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:43:41,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:43:41,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:43:41,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:43:41,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:43:41,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:43:41,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:43:41,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:43:41,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:43:41,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:43:41,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:43:41,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:43:41,378 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:43:41,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:43:41,380 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:43:41,381 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:43:41,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:43:41,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:43:41,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:43:41,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:43:41,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:43:41,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:43:41,399 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:43:41,399 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:43:41,399 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:43:41,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:43:41,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:43:41,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:43:41,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:43:41,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:43:41,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:43:41,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:43:41,406 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:43:41,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:43:41,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:43:41,408 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:43:41,408 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:43:41,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:43:41,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:43:41,426 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:43:41,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:43:41,426 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:43:41,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:43:41,427 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:43:41,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:43:41,427 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:43:41,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:43:41,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:43:41,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:43:41,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:43:41,428 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:43:41,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:43:41,429 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:43:41,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:43:41,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:43:41,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:43:41,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:43:41,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:43:41,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:43:41,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:43:41,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:43:41,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:43:41,431 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:43:41,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:43:41,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:43:41,431 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 -> 8094c843e4d897e4501a7b90ca3369f741555e9e [2018-12-31 09:43:41,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:43:41,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:43:41,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:43:41,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:43:41,485 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:43:41,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:41,542 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce753cfd/808e191890af48468d8d83309f35ce2d/FLAG1b83f52df [2018-12-31 09:43:42,062 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:43:42,063 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:42,081 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce753cfd/808e191890af48468d8d83309f35ce2d/FLAG1b83f52df [2018-12-31 09:43:42,344 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce753cfd/808e191890af48468d8d83309f35ce2d [2018-12-31 09:43:42,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:43:42,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:43:42,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:42,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:43:42,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:43:42,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:42,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9e942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42, skipping insertion in model container [2018-12-31 09:43:42,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:42,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:43:42,440 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:43:42,842 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:42,855 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:43:42,960 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:42,999 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:43:43,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42 WrapperNode [2018-12-31 09:43:43,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:43,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:43,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:43:43,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:43:43,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:43,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:43:43,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:43:43,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:43:43,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:43,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:43:43,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:43:43,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:43:43,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:43:43,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:43:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:43:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:43:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:43:43,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:43:44,431 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:43:44,431 INFO L280 CfgBuilder]: Removed 102 assue(true) statements. [2018-12-31 09:43:44,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:44 BoogieIcfgContainer [2018-12-31 09:43:44,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:43:44,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:43:44,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:43:44,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:43:44,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:43:42" (1/3) ... [2018-12-31 09:43:44,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a80e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:44, skipping insertion in model container [2018-12-31 09:43:44,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42" (2/3) ... [2018-12-31 09:43:44,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a80e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:44, skipping insertion in model container [2018-12-31 09:43:44,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:44" (3/3) ... [2018-12-31 09:43:44,441 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:44,452 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:43:44,468 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:43:44,487 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:43:44,520 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:43:44,521 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:43:44,521 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:43:44,522 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:43:44,522 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:43:44,522 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:43:44,522 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:43:44,522 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:43:44,523 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:43:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-12-31 09:43:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:43:44,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:44,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:44,552 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -502845476, now seen corresponding path program 1 times [2018-12-31 09:43:44,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:44,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:44,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:44,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:44,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:44,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:44,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:43:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:43:44,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:43:44,863 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-12-31 09:43:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:44,898 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2018-12-31 09:43:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:43:44,900 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:43:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:44,918 INFO L225 Difference]: With dead ends: 154 [2018-12-31 09:43:44,918 INFO L226 Difference]: Without dead ends: 76 [2018-12-31 09:43:44,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:43:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-31 09:43:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-31 09:43:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-31 09:43:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2018-12-31 09:43:44,966 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 16 [2018-12-31 09:43:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:44,966 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2018-12-31 09:43:44,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:43:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2018-12-31 09:43:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:43:44,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:44,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:44,969 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:44,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1549602373, now seen corresponding path program 1 times [2018-12-31 09:43:44,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:44,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:44,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:44,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:44,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:45,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:45,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:43:45,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:45,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:45,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:45,164 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand 3 states. [2018-12-31 09:43:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:45,185 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2018-12-31 09:43:45,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:45,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:43:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:45,188 INFO L225 Difference]: With dead ends: 76 [2018-12-31 09:43:45,189 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 09:43:45,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 09:43:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-31 09:43:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:43:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-12-31 09:43:45,207 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2018-12-31 09:43:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:45,209 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-12-31 09:43:45,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-12-31 09:43:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:43:45,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,211 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] [2018-12-31 09:43:45,211 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1499295122, now seen corresponding path program 1 times [2018-12-31 09:43:45,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:45,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:45,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:43:45,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:45,353 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-12-31 09:43:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:45,420 INFO L93 Difference]: Finished difference Result 96 states and 141 transitions. [2018-12-31 09:43:45,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:45,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-31 09:43:45,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:45,423 INFO L225 Difference]: With dead ends: 96 [2018-12-31 09:43:45,424 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 09:43:45,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 09:43:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-12-31 09:43:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-31 09:43:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2018-12-31 09:43:45,437 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 22 [2018-12-31 09:43:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:45,437 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2018-12-31 09:43:45,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2018-12-31 09:43:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:43:45,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,440 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] [2018-12-31 09:43:45,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1870150441, now seen corresponding path program 1 times [2018-12-31 09:43:45,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:45,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:45,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:45,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:45,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:45,546 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 3 states. [2018-12-31 09:43:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:45,683 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2018-12-31 09:43:45,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:45,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 09:43:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:45,684 INFO L225 Difference]: With dead ends: 159 [2018-12-31 09:43:45,685 INFO L226 Difference]: Without dead ends: 103 [2018-12-31 09:43:45,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-31 09:43:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-31 09:43:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-31 09:43:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2018-12-31 09:43:45,711 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 23 [2018-12-31 09:43:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:45,712 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2018-12-31 09:43:45,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2018-12-31 09:43:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:43:45,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,714 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] [2018-12-31 09:43:45,715 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash 944519591, now seen corresponding path program 1 times [2018-12-31 09:43:45,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:46,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:46,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:43:46,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:46,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:46,018 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand 5 states. [2018-12-31 09:43:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:46,336 INFO L93 Difference]: Finished difference Result 369 states and 545 transitions. [2018-12-31 09:43:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:46,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:43:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:46,344 INFO L225 Difference]: With dead ends: 369 [2018-12-31 09:43:46,344 INFO L226 Difference]: Without dead ends: 274 [2018-12-31 09:43:46,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-31 09:43:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 182. [2018-12-31 09:43:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-31 09:43:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 256 transitions. [2018-12-31 09:43:46,398 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 256 transitions. Word has length 25 [2018-12-31 09:43:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:46,399 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 256 transitions. [2018-12-31 09:43:46,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 256 transitions. [2018-12-31 09:43:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:43:46,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:46,405 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, 1] [2018-12-31 09:43:46,405 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1014789399, now seen corresponding path program 1 times [2018-12-31 09:43:46,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:46,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:46,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:46,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:43:46,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:46,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:46,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:46,651 INFO L87 Difference]: Start difference. First operand 182 states and 256 transitions. Second operand 5 states. [2018-12-31 09:43:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:47,172 INFO L93 Difference]: Finished difference Result 368 states and 530 transitions. [2018-12-31 09:43:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:43:47,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:43:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:47,176 INFO L225 Difference]: With dead ends: 368 [2018-12-31 09:43:47,176 INFO L226 Difference]: Without dead ends: 366 [2018-12-31 09:43:47,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:43:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-31 09:43:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 182. [2018-12-31 09:43:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-31 09:43:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 254 transitions. [2018-12-31 09:43:47,230 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 254 transitions. Word has length 26 [2018-12-31 09:43:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:47,230 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 254 transitions. [2018-12-31 09:43:47,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 254 transitions. [2018-12-31 09:43:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:43:47,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:47,236 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, 1, 1, 1, 1, 1] [2018-12-31 09:43:47,236 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:47,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1944189962, now seen corresponding path program 1 times [2018-12-31 09:43:47,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:47,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:47,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:47,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:47,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:47,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:47,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:47,521 INFO L87 Difference]: Start difference. First operand 182 states and 254 transitions. Second operand 5 states. [2018-12-31 09:43:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:47,800 INFO L93 Difference]: Finished difference Result 505 states and 702 transitions. [2018-12-31 09:43:47,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:47,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:43:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:47,804 INFO L225 Difference]: With dead ends: 505 [2018-12-31 09:43:47,812 INFO L226 Difference]: Without dead ends: 329 [2018-12-31 09:43:47,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:43:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-12-31 09:43:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 194. [2018-12-31 09:43:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-31 09:43:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2018-12-31 09:43:47,845 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 30 [2018-12-31 09:43:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:47,848 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2018-12-31 09:43:47,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2018-12-31 09:43:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:43:47,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:47,851 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, 1, 1, 1, 1, 1] [2018-12-31 09:43:47,851 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:47,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1551162952, now seen corresponding path program 1 times [2018-12-31 09:43:47,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:47,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:47,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:47,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:48,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:48,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:48,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:48,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:48,130 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand 5 states. [2018-12-31 09:43:48,518 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 09:43:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:48,830 INFO L93 Difference]: Finished difference Result 479 states and 651 transitions. [2018-12-31 09:43:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:43:48,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:43:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:48,834 INFO L225 Difference]: With dead ends: 479 [2018-12-31 09:43:48,834 INFO L226 Difference]: Without dead ends: 291 [2018-12-31 09:43:48,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:43:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-31 09:43:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 159. [2018-12-31 09:43:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-31 09:43:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 214 transitions. [2018-12-31 09:43:48,862 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 214 transitions. Word has length 30 [2018-12-31 09:43:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:48,862 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 214 transitions. [2018-12-31 09:43:48,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 214 transitions. [2018-12-31 09:43:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:43:48,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:48,865 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, 1, 1, 1, 1, 1] [2018-12-31 09:43:48,865 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:48,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1809328390, now seen corresponding path program 1 times [2018-12-31 09:43:48,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:48,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:48,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:48,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:48,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:49,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:49,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:49,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:49,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:49,135 INFO L87 Difference]: Start difference. First operand 159 states and 214 transitions. Second operand 5 states. [2018-12-31 09:43:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:49,806 INFO L93 Difference]: Finished difference Result 420 states and 588 transitions. [2018-12-31 09:43:49,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:49,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:43:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:49,810 INFO L225 Difference]: With dead ends: 420 [2018-12-31 09:43:49,810 INFO L226 Difference]: Without dead ends: 315 [2018-12-31 09:43:49,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-31 09:43:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 236. [2018-12-31 09:43:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-31 09:43:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 315 transitions. [2018-12-31 09:43:49,845 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 315 transitions. Word has length 30 [2018-12-31 09:43:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:49,845 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 315 transitions. [2018-12-31 09:43:49,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 315 transitions. [2018-12-31 09:43:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 09:43:49,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:49,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1] [2018-12-31 09:43:49,849 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:49,850 INFO L82 PathProgramCache]: Analyzing trace with hash 61594744, now seen corresponding path program 1 times [2018-12-31 09:43:49,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:49,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:49,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:49,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:50,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:43:50,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:43:50,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:50,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:43:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:43:50,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:43:50,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:43:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:43:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:43:50,309 INFO L87 Difference]: Start difference. First operand 236 states and 315 transitions. Second operand 6 states. [2018-12-31 09:43:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:51,377 INFO L93 Difference]: Finished difference Result 699 states and 959 transitions. [2018-12-31 09:43:51,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:43:51,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-31 09:43:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:51,382 INFO L225 Difference]: With dead ends: 699 [2018-12-31 09:43:51,383 INFO L226 Difference]: Without dead ends: 517 [2018-12-31 09:43:51,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:43:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-12-31 09:43:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 321. [2018-12-31 09:43:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-31 09:43:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 433 transitions. [2018-12-31 09:43:51,450 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 433 transitions. Word has length 45 [2018-12-31 09:43:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:51,450 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 433 transitions. [2018-12-31 09:43:51,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:43:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 433 transitions. [2018-12-31 09:43:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 09:43:51,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:51,455 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-31 09:43:51,457 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash -594503994, now seen corresponding path program 2 times [2018-12-31 09:43:51,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:51,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:51,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:51,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:43:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:43:52,296 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:43:52,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:43:52 BoogieIcfgContainer [2018-12-31 09:43:52,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:43:52,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:43:52,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:43:52,443 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:43:52,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:44" (3/4) ... [2018-12-31 09:43:52,447 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:43:52,608 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:43:52,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:43:52,609 INFO L168 Benchmark]: Toolchain (without parser) took 10259.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 951.3 MB in the beginning and 958.6 MB in the end (delta: -7.3 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,610 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. [2018-12-31 09:43:52,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,611 INFO L168 Benchmark]: Boogie Preprocessor took 48.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:43:52,612 INFO L168 Benchmark]: RCFGBuilder took 1222.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,612 INFO L168 Benchmark]: TraceAbstraction took 8009.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 982.0 MB in the end (delta: 81.6 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,612 INFO L168 Benchmark]: Witness Printer took 165.15 ms. Allocated memory is still 1.2 GB. Free memory was 982.0 MB in the beginning and 958.6 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,617 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 648.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 158.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1222.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8009.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 982.0 MB in the end (delta: 81.6 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. * Witness Printer took 165.15 ms. Allocated memory is still 1.2 GB. Free memory was 982.0 MB in the beginning and 958.6 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 437]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L123] int pumpRunning = 0; [L124] int systemActive = 1; [L299] int cleanupTimeShifts = 4; [L611] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L809] int waterLevel = 1; [L810] int methaneLevelCritical = 0; [L375] int retValue_acc ; [L376] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L424] int retValue_acc ; [L427] retValue_acc = 1 [L428] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L382] tmp = valid_product() [L384] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L47] int splverifierCounter ; [L48] int tmp ; [L49] int tmp___0 ; [L50] int tmp___1 ; [L51] int tmp___2 ; [L54] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L64] tmp = __VERIFIER_nondet_int() [L66] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L827] COND TRUE waterLevel < 2 [L828] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L294] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L131] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L138] COND TRUE \read(systemActive) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L163] COND TRUE ! pumpRunning [L257] int retValue_acc ; [L258] int tmp ; [L259] int tmp___0 ; [L889] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L892] COND FALSE !(waterLevel < 2) [L896] retValue_acc = 0 [L897] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L263] tmp = isHighWaterSensorDry() [L265] COND FALSE !(\read(tmp)) [L268] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L270] retValue_acc = tmp___0 [L271] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L165] tmp = isHighWaterLevel() [L167] COND TRUE \read(tmp) [L188] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L904] int tmp ; [L905] int tmp___0 ; [L880] int retValue_acc ; [L883] retValue_acc = waterLevel [L884] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L909] tmp = getWaterLevel() [L911] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L294] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L131] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L815] COND TRUE waterLevel > 0 [L816] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L138] COND TRUE \read(systemActive) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L163] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L904] int tmp ; [L905] int tmp___0 ; [L880] int retValue_acc ; [L883] retValue_acc = waterLevel [L884] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L909] tmp = getWaterLevel() [L911] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L294] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L131] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L815] COND TRUE waterLevel > 0 [L816] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L138] COND TRUE \read(systemActive) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L163] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L904] int tmp ; [L905] int tmp___0 ; [L880] int retValue_acc ; [L883] retValue_acc = waterLevel [L884] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L909] tmp = getWaterLevel() [L911] COND TRUE tmp == 0 [L212] int retValue_acc ; [L215] retValue_acc = pumpRunning [L216] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L913] tmp___0 = isPumpRunning() [L915] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L437] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 3 error locations. UNSAFE Result, 7.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 794 SDtfs, 1113 SDslu, 1284 SDs, 0 SdLazy, 203 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 824 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 17038 SizeOfPredicates, 4 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...