./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_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_spec2_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 49fa497f38e3a46185ee804b3f30fdc119cb200c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:42:03,329 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:42:03,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:42:03,343 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:42:03,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:42:03,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:42:03,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:42:03,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:42:03,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:42:03,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:42:03,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:42:03,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:42:03,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:42:03,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:42:03,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:42:03,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:42:03,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:42:03,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:42:03,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:42:03,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:42:03,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:42:03,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:42:03,366 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:42:03,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:42:03,367 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:42:03,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:42:03,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:42:03,369 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:42:03,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:42:03,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:42:03,371 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:42:03,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:42:03,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:42:03,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:42:03,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:42:03,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:42:03,374 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:42:03,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:42:03,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:42:03,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:42:03,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:42:03,391 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:42:03,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:42:03,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:42:03,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:42:03,392 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:42:03,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:42:03,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:42:03,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:42:03,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:42:03,393 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:42:03,393 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:42:03,393 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:42:03,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:42:03,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:42:03,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:42:03,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:42:03,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:42:03,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:42:03,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:42:03,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:42:03,395 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:42:03,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:42:03,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:42:03,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:42:03,395 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 -> 49fa497f38e3a46185ee804b3f30fdc119cb200c [2018-12-31 09:42:03,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:42:03,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:42:03,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:42:03,456 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:42:03,457 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:42:03,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:03,521 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f39fa78/a9f3901f7ad6441ba426c242858acb97/FLAG2801d78dd [2018-12-31 09:42:04,027 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:42:04,030 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:04,044 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f39fa78/a9f3901f7ad6441ba426c242858acb97/FLAG2801d78dd [2018-12-31 09:42:04,344 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f39fa78/a9f3901f7ad6441ba426c242858acb97 [2018-12-31 09:42:04,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:42:04,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:42:04,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:04,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:42:04,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:42:04,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:04" (1/1) ... [2018-12-31 09:42:04,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:04, skipping insertion in model container [2018-12-31 09:42:04,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:04" (1/1) ... [2018-12-31 09:42:04,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:42:04,434 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:42:04,858 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:04,874 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:42:04,999 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:05,040 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:42:05,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05 WrapperNode [2018-12-31 09:42:05,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:05,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:05,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:42:05,043 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:42:05,130 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:42:05" (1/1) ... [2018-12-31 09:42:05,151 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:42:05" (1/1) ... [2018-12-31 09:42:05,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:05,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:42:05,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:42:05,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:42:05,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (1/1) ... [2018-12-31 09:42:05,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (1/1) ... [2018-12-31 09:42:05,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (1/1) ... [2018-12-31 09:42:05,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (1/1) ... [2018-12-31 09:42:05,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (1/1) ... [2018-12-31 09:42:05,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (1/1) ... [2018-12-31 09:42:05,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (1/1) ... [2018-12-31 09:42:05,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:42:05,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:42:05,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:42:05,248 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:42:05,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (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:42:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:42:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:42:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:42:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:42:06,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:42:06,516 INFO L280 CfgBuilder]: Removed 104 assue(true) statements. [2018-12-31 09:42:06,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:06 BoogieIcfgContainer [2018-12-31 09:42:06,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:42:06,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:42:06,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:42:06,520 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:42:06,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:42:04" (1/3) ... [2018-12-31 09:42:06,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4a066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:06, skipping insertion in model container [2018-12-31 09:42:06,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:05" (2/3) ... [2018-12-31 09:42:06,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4a066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:06, skipping insertion in model container [2018-12-31 09:42:06,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:06" (3/3) ... [2018-12-31 09:42:06,524 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:06,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:42:06,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:42:06,561 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:42:06,591 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:42:06,592 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:42:06,592 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:42:06,592 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:42:06,592 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:42:06,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:42:06,593 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:42:06,593 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:42:06,593 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:42:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-12-31 09:42:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 09:42:06,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:06,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:06,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1480559057, now seen corresponding path program 1 times [2018-12-31 09:42:06,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:06,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:06,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:06,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:06,931 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:42:06,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:06,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:06,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:42:06,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:42:06,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:42:06,952 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-12-31 09:42:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:06,980 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2018-12-31 09:42:06,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:42:06,982 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 09:42:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:06,995 INFO L225 Difference]: With dead ends: 161 [2018-12-31 09:42:06,995 INFO L226 Difference]: Without dead ends: 80 [2018-12-31 09:42:07,000 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:42:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-31 09:42:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-31 09:42:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-31 09:42:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2018-12-31 09:42:07,046 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 18 [2018-12-31 09:42:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:07,047 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2018-12-31 09:42:07,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:42:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2018-12-31 09:42:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:42:07,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:07,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:07,049 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:07,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1228794243, now seen corresponding path program 1 times [2018-12-31 09:42:07,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:07,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:07,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:07,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:07,217 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:42:07,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:07,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:07,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:07,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:07,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:07,223 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand 3 states. [2018-12-31 09:42:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:07,255 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2018-12-31 09:42:07,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:07,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 09:42:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:07,258 INFO L225 Difference]: With dead ends: 80 [2018-12-31 09:42:07,258 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 09:42:07,261 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:42:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 09:42:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-31 09:42:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 09:42:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2018-12-31 09:42:07,272 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 19 [2018-12-31 09:42:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:07,272 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2018-12-31 09:42:07,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2018-12-31 09:42:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:42:07,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:07,275 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] [2018-12-31 09:42:07,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1219405376, now seen corresponding path program 1 times [2018-12-31 09:42:07,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:07,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:07,451 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:42:07,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:07,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:07,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:07,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:07,453 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand 3 states. [2018-12-31 09:42:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:07,512 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2018-12-31 09:42:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:07,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:42:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:07,514 INFO L225 Difference]: With dead ends: 100 [2018-12-31 09:42:07,514 INFO L226 Difference]: Without dead ends: 69 [2018-12-31 09:42:07,515 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:42:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-31 09:42:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-12-31 09:42:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-31 09:42:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2018-12-31 09:42:07,527 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 24 [2018-12-31 09:42:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:07,528 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2018-12-31 09:42:07,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2018-12-31 09:42:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:42:07,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:07,529 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:42:07,530 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash 999444121, now seen corresponding path program 1 times [2018-12-31 09:42:07,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:07,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:07,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:07,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:07,629 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:42:07,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:07,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:07,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:07,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:07,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:07,631 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 3 states. [2018-12-31 09:42:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:07,747 INFO L93 Difference]: Finished difference Result 166 states and 251 transitions. [2018-12-31 09:42:07,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:07,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:42:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:07,750 INFO L225 Difference]: With dead ends: 166 [2018-12-31 09:42:07,750 INFO L226 Difference]: Without dead ends: 108 [2018-12-31 09:42:07,751 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:42:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-31 09:42:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-12-31 09:42:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-31 09:42:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2018-12-31 09:42:07,767 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 25 [2018-12-31 09:42:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:07,767 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2018-12-31 09:42:07,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2018-12-31 09:42:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 09:42:07,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:07,769 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] [2018-12-31 09:42:07,769 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:07,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:07,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1239284745, now seen corresponding path program 1 times [2018-12-31 09:42:07,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:07,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:08,006 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:42:08,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:08,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:08,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:08,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:08,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:08,008 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand 5 states. [2018-12-31 09:42:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:08,357 INFO L93 Difference]: Finished difference Result 510 states and 765 transitions. [2018-12-31 09:42:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:42:08,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-31 09:42:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:08,366 INFO L225 Difference]: With dead ends: 510 [2018-12-31 09:42:08,368 INFO L226 Difference]: Without dead ends: 411 [2018-12-31 09:42:08,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 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:42:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-31 09:42:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 191. [2018-12-31 09:42:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-31 09:42:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2018-12-31 09:42:08,442 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 27 [2018-12-31 09:42:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:08,443 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2018-12-31 09:42:08,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2018-12-31 09:42:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 09:42:08,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:08,447 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] [2018-12-31 09:42:08,448 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:08,448 INFO L82 PathProgramCache]: Analyzing trace with hash -194860415, now seen corresponding path program 1 times [2018-12-31 09:42:08,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:08,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:08,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:08,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:08,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:08,734 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:42:08,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:08,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:08,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:08,737 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand 5 states. [2018-12-31 09:42:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:09,486 INFO L93 Difference]: Finished difference Result 709 states and 1031 transitions. [2018-12-31 09:42:09,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:42:09,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-31 09:42:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:09,491 INFO L225 Difference]: With dead ends: 709 [2018-12-31 09:42:09,492 INFO L226 Difference]: Without dead ends: 525 [2018-12-31 09:42:09,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-12-31 09:42:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 189. [2018-12-31 09:42:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-31 09:42:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 270 transitions. [2018-12-31 09:42:09,550 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 270 transitions. Word has length 28 [2018-12-31 09:42:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:09,550 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 270 transitions. [2018-12-31 09:42:09,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 270 transitions. [2018-12-31 09:42:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:09,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:09,557 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, 1, 1] [2018-12-31 09:42:09,557 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1409937664, now seen corresponding path program 1 times [2018-12-31 09:42:09,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:09,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:09,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:09,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:09,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:09,734 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:42:09,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:09,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:09,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:09,736 INFO L87 Difference]: Start difference. First operand 189 states and 270 transitions. Second operand 5 states. [2018-12-31 09:42:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:10,188 INFO L93 Difference]: Finished difference Result 515 states and 728 transitions. [2018-12-31 09:42:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:10,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:42:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:10,196 INFO L225 Difference]: With dead ends: 515 [2018-12-31 09:42:10,196 INFO L226 Difference]: Without dead ends: 333 [2018-12-31 09:42:10,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:42:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-31 09:42:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 201. [2018-12-31 09:42:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-31 09:42:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2018-12-31 09:42:10,235 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 32 [2018-12-31 09:42:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:10,235 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2018-12-31 09:42:10,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2018-12-31 09:42:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:10,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:10,242 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, 1, 1] [2018-12-31 09:42:10,243 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2111002242, now seen corresponding path program 1 times [2018-12-31 09:42:10,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:10,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:10,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:10,380 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:42:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:10,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:42:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:42:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:42:10,383 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand 4 states. [2018-12-31 09:42:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:10,659 INFO L93 Difference]: Finished difference Result 491 states and 683 transitions. [2018-12-31 09:42:10,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:42:10,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-31 09:42:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:10,663 INFO L225 Difference]: With dead ends: 491 [2018-12-31 09:42:10,663 INFO L226 Difference]: Without dead ends: 297 [2018-12-31 09:42:10,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-31 09:42:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 209. [2018-12-31 09:42:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-31 09:42:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 290 transitions. [2018-12-31 09:42:10,699 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 290 transitions. Word has length 32 [2018-12-31 09:42:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:10,699 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 290 transitions. [2018-12-31 09:42:10,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:42:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 290 transitions. [2018-12-31 09:42:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:10,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:10,702 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, 1, 1] [2018-12-31 09:42:10,702 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1524196228, now seen corresponding path program 1 times [2018-12-31 09:42:10,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:10,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:10,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:10,794 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:42:10,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:10,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:10,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:10,796 INFO L87 Difference]: Start difference. First operand 209 states and 290 transitions. Second operand 3 states. [2018-12-31 09:42:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:10,957 INFO L93 Difference]: Finished difference Result 511 states and 703 transitions. [2018-12-31 09:42:10,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:10,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-31 09:42:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:10,961 INFO L225 Difference]: With dead ends: 511 [2018-12-31 09:42:10,961 INFO L226 Difference]: Without dead ends: 309 [2018-12-31 09:42:10,962 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:42:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-31 09:42:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-12-31 09:42:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-12-31 09:42:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 412 transitions. [2018-12-31 09:42:11,007 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 412 transitions. Word has length 32 [2018-12-31 09:42:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:11,008 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 412 transitions. [2018-12-31 09:42:11,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 412 transitions. [2018-12-31 09:42:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:42:11,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:11,011 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, 1, 1, 1] [2018-12-31 09:42:11,012 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash 61292740, now seen corresponding path program 1 times [2018-12-31 09:42:11,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:11,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:11,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:11,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:11,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:11,099 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:42:11,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:11,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:11,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:11,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:11,100 INFO L87 Difference]: Start difference. First operand 309 states and 412 transitions. Second operand 3 states. [2018-12-31 09:42:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:11,278 INFO L93 Difference]: Finished difference Result 447 states and 603 transitions. [2018-12-31 09:42:11,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:11,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-31 09:42:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:11,282 INFO L225 Difference]: With dead ends: 447 [2018-12-31 09:42:11,283 INFO L226 Difference]: Without dead ends: 445 [2018-12-31 09:42:11,283 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:42:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-12-31 09:42:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 370. [2018-12-31 09:42:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-12-31 09:42:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 504 transitions. [2018-12-31 09:42:11,367 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 504 transitions. Word has length 33 [2018-12-31 09:42:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:11,368 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 504 transitions. [2018-12-31 09:42:11,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 504 transitions. [2018-12-31 09:42:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:42:11,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:11,370 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2018-12-31 09:42:11,372 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash 290012344, now seen corresponding path program 1 times [2018-12-31 09:42:11,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:11,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:11,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:11,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:11,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:12,006 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:42:12,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:42:12 BoogieIcfgContainer [2018-12-31 09:42:12,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:42:12,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:42:12,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:42:12,212 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:42:12,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:06" (3/4) ... [2018-12-31 09:42:12,217 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:42:12,377 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:42:12,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:42:12,378 INFO L168 Benchmark]: Toolchain (without parser) took 8029.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -69.8 MB). Peak memory consumption was 144.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:12,380 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:42:12,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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:42:12,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -209.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:12,381 INFO L168 Benchmark]: Boogie Preprocessor took 50.26 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:42:12,381 INFO L168 Benchmark]: RCFGBuilder took 1268.64 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: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:12,381 INFO L168 Benchmark]: TraceAbstraction took 5694.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.8 MB). Peak memory consumption was 99.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:12,383 INFO L168 Benchmark]: Witness Printer took 165.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:12,386 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 691.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 151.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -209.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.26 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 1268.64 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: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5694.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.8 MB). Peak memory consumption was 99.5 MB. Max. memory is 11.5 GB. * Witness Printer took 165.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 900]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L310] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L545] int cleanupTimeShifts = 4; [L651] int pumpRunning = 0; [L652] int systemActive = 1; [L905] int methAndRunningLastTime ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L623] int retValue_acc ; [L624] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L536] int retValue_acc ; [L539] retValue_acc = 1 [L540] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L630] tmp = valid_product() [L632] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L910] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L828] int splverifierCounter ; [L829] int tmp ; [L830] int tmp___0 ; [L831] int tmp___1 ; [L832] int tmp___2 ; [L835] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L837] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L839] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L845] tmp = __VERIFIER_nondet_int() [L847] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L855] tmp___0 = __VERIFIER_nondet_int() [L857] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L865] tmp___2 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp___2) [L822] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L659] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L666] COND TRUE \read(systemActive) [L688] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L691] COND TRUE ! pumpRunning [L785] int retValue_acc ; [L786] int tmp ; [L787] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L791] tmp = isHighWaterSensorDry() [L793] COND FALSE !(\read(tmp)) [L796] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L798] retValue_acc = tmp___0 [L799] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L693] tmp = isHighWaterLevel() [L695] COND TRUE \read(tmp) [L716] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L915] int tmp ; [L916] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L920] tmp = isMethaneLevelCritical() [L922] COND TRUE \read(tmp) [L740] int retValue_acc ; [L743] retValue_acc = pumpRunning [L744] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L924] tmp___0 = isPumpRunning() [L926] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L927] COND FALSE !(\read(methAndRunningLastTime)) [L932] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L837] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L839] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L845] tmp = __VERIFIER_nondet_int() [L847] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L855] tmp___0 = __VERIFIER_nondet_int() [L857] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L865] tmp___2 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp___2) [L822] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L659] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L666] COND TRUE \read(systemActive) [L688] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L691] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L915] int tmp ; [L916] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L920] tmp = isMethaneLevelCritical() [L922] COND TRUE \read(tmp) [L740] int retValue_acc ; [L743] retValue_acc = pumpRunning [L744] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L924] tmp___0 = isPumpRunning() [L926] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L927] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L900] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. UNSAFE Result, 5.6s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 712 SDtfs, 715 SDslu, 965 SDs, 0 SdLazy, 112 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred 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, 857 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 13656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...