./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product35_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_product35_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 c300c29b8d9fc061a97d8a30a731a0ec640f0644 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:01,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:42:01,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:42:01,298 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:42:01,298 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:42:01,299 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:42:01,301 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:42:01,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:42:01,305 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:42:01,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:42:01,306 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:42:01,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:42:01,308 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:42:01,309 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:42:01,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:42:01,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:42:01,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:42:01,314 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:42:01,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:42:01,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:42:01,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:42:01,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:42:01,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:42:01,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:42:01,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:42:01,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:42:01,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:42:01,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:42:01,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:42:01,330 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:42:01,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:42:01,331 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:42:01,331 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:42:01,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:42:01,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:42:01,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:42:01,334 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:01,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:42:01,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:42:01,355 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:42:01,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:42:01,355 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:42:01,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:42:01,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:42:01,356 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:42:01,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:42:01,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:42:01,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:42:01,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:42:01,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:42:01,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:42:01,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:42:01,358 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:42:01,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:42:01,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:42:01,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:42:01,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:42:01,360 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:42:01,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:42:01,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:42:01,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:42:01,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:42:01,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:42:01,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:42:01,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:42:01,363 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 -> c300c29b8d9fc061a97d8a30a731a0ec640f0644 [2018-12-31 09:42:01,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:42:01,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:42:01,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:42:01,443 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:42:01,444 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:42:01,444 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product35_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:01,522 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8684b6471/587c3e8339af4077b074e876840531aa/FLAG9dd142eae [2018-12-31 09:42:02,064 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:42:02,065 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product35_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:02,082 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8684b6471/587c3e8339af4077b074e876840531aa/FLAG9dd142eae [2018-12-31 09:42:02,334 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8684b6471/587c3e8339af4077b074e876840531aa [2018-12-31 09:42:02,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:42:02,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:42:02,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:02,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:42:02,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:42:02,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:02" (1/1) ... [2018-12-31 09:42:02,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704d4b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:02, skipping insertion in model container [2018-12-31 09:42:02,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:02" (1/1) ... [2018-12-31 09:42:02,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:42:02,430 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:42:02,774 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:02,799 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:42:02,922 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:03,060 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:42:03,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:03 WrapperNode [2018-12-31 09:42:03,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:03,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:03,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:42:03,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:42:03,072 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:03" (1/1) ... [2018-12-31 09:42:03,093 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:03" (1/1) ... [2018-12-31 09:42:03,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:03,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:42:03,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:42:03,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:42:03,143 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:03" (1/1) ... [2018-12-31 09:42:03,143 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:03" (1/1) ... [2018-12-31 09:42:03,148 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:03" (1/1) ... [2018-12-31 09:42:03,148 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:03" (1/1) ... [2018-12-31 09:42:03,158 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:03" (1/1) ... [2018-12-31 09:42:03,166 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:03" (1/1) ... [2018-12-31 09:42:03,169 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:03" (1/1) ... [2018-12-31 09:42:03,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:42:03,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:42:03,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:42:03,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:42:03,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:03" (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:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:42:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:42:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:42:03,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:42:04,529 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:42:04,530 INFO L280 CfgBuilder]: Removed 102 assue(true) statements. [2018-12-31 09:42:04,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:04 BoogieIcfgContainer [2018-12-31 09:42:04,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:42:04,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:42:04,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:42:04,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:42:04,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:42:02" (1/3) ... [2018-12-31 09:42:04,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d31daf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:04, skipping insertion in model container [2018-12-31 09:42:04,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:03" (2/3) ... [2018-12-31 09:42:04,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d31daf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:04, skipping insertion in model container [2018-12-31 09:42:04,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:04" (3/3) ... [2018-12-31 09:42:04,540 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product35_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:04,551 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:42:04,560 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:42:04,578 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:42:04,612 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:42:04,613 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:42:04,613 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:42:04,614 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:42:04,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:42:04,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:42:04,615 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:42:04,615 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:42:04,615 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:42:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-12-31 09:42:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 09:42:04,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:04,644 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:04,647 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1673386384, now seen corresponding path program 1 times [2018-12-31 09:42:04,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:04,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:04,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:04,896 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:04,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:04,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:04,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:42:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:42:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:42:04,923 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-12-31 09:42:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:04,954 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2018-12-31 09:42:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:42:04,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 09:42:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:04,971 INFO L225 Difference]: With dead ends: 161 [2018-12-31 09:42:04,971 INFO L226 Difference]: Without dead ends: 80 [2018-12-31 09:42:04,975 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:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-31 09:42:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-31 09:42:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-31 09:42:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2018-12-31 09:42:05,023 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 18 [2018-12-31 09:42:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:05,024 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2018-12-31 09:42:05,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:42:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2018-12-31 09:42:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:42:05,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:05,025 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:05,026 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash 572864739, now seen corresponding path program 1 times [2018-12-31 09:42:05,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:05,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:05,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:05,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:05,187 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:05,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:05,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:05,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:05,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:05,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:05,190 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand 3 states. [2018-12-31 09:42:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:05,215 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2018-12-31 09:42:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:05,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 09:42:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:05,216 INFO L225 Difference]: With dead ends: 80 [2018-12-31 09:42:05,217 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 09:42:05,218 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:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 09:42:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-31 09:42:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 09:42:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2018-12-31 09:42:05,225 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 19 [2018-12-31 09:42:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:05,225 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2018-12-31 09:42:05,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2018-12-31 09:42:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:42:05,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:05,227 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:05,227 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2071848385, now seen corresponding path program 1 times [2018-12-31 09:42:05,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:05,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:05,508 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:05,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:05,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:05,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:42:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:42:05,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:42:05,510 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand 6 states. [2018-12-31 09:42:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:05,709 INFO L93 Difference]: Finished difference Result 124 states and 184 transitions. [2018-12-31 09:42:05,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:05,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-31 09:42:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:05,715 INFO L225 Difference]: With dead ends: 124 [2018-12-31 09:42:05,715 INFO L226 Difference]: Without dead ends: 93 [2018-12-31 09:42:05,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:42:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-31 09:42:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 58. [2018-12-31 09:42:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-31 09:42:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2018-12-31 09:42:05,749 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 24 [2018-12-31 09:42:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:05,749 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2018-12-31 09:42:05,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:42:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2018-12-31 09:42:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:42:05,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:05,754 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:05,755 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash 343514617, now seen corresponding path program 1 times [2018-12-31 09:42:05,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:05,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:05,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:05,937 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:05,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:05,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:05,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:05,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:05,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:05,940 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand 3 states. [2018-12-31 09:42:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:06,152 INFO L93 Difference]: Finished difference Result 131 states and 195 transitions. [2018-12-31 09:42:06,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:06,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:42:06,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:06,155 INFO L225 Difference]: With dead ends: 131 [2018-12-31 09:42:06,155 INFO L226 Difference]: Without dead ends: 80 [2018-12-31 09:42:06,156 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:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-31 09:42:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-31 09:42:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-31 09:42:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2018-12-31 09:42:06,176 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 25 [2018-12-31 09:42:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:06,177 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2018-12-31 09:42:06,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2018-12-31 09:42:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 09:42:06,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:06,178 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:06,179 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:06,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:06,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1750340408, now seen corresponding path program 1 times [2018-12-31 09:42:06,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:06,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:06,377 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,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:06,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:06,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:06,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:06,381 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 5 states. [2018-12-31 09:42:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:06,592 INFO L93 Difference]: Finished difference Result 361 states and 530 transitions. [2018-12-31 09:42:06,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:42:06,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-31 09:42:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:06,600 INFO L225 Difference]: With dead ends: 361 [2018-12-31 09:42:06,601 INFO L226 Difference]: Without dead ends: 290 [2018-12-31 09:42:06,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-31 09:42:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 138. [2018-12-31 09:42:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-31 09:42:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2018-12-31 09:42:06,654 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 195 transitions. Word has length 27 [2018-12-31 09:42:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:06,654 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-12-31 09:42:06,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2018-12-31 09:42:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 09:42:06,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:06,661 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:06,661 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1110481728, now seen corresponding path program 1 times [2018-12-31 09:42:06,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:06,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:06,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:06,839 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,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:06,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:06,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:06,843 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. Second operand 5 states. [2018-12-31 09:42:07,296 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 09:42:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:07,674 INFO L93 Difference]: Finished difference Result 499 states and 711 transitions. [2018-12-31 09:42:07,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:42:07,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-31 09:42:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:07,678 INFO L225 Difference]: With dead ends: 499 [2018-12-31 09:42:07,678 INFO L226 Difference]: Without dead ends: 368 [2018-12-31 09:42:07,679 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:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-12-31 09:42:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 136. [2018-12-31 09:42:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-31 09:42:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2018-12-31 09:42:07,706 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 28 [2018-12-31 09:42:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:07,707 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2018-12-31 09:42:07,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2018-12-31 09:42:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:07,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:07,708 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:07,709 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2071146496, now seen corresponding path program 1 times [2018-12-31 09:42:07,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:07,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:07,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:07,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:07,939 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,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:07,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:07,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:07,942 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand 5 states. [2018-12-31 09:42:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:08,078 INFO L93 Difference]: Finished difference Result 401 states and 556 transitions. [2018-12-31 09:42:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:08,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:42:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:08,081 INFO L225 Difference]: With dead ends: 401 [2018-12-31 09:42:08,081 INFO L226 Difference]: Without dead ends: 272 [2018-12-31 09:42:08,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:42:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-31 09:42:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 142. [2018-12-31 09:42:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-31 09:42:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 195 transitions. [2018-12-31 09:42:08,115 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 195 transitions. Word has length 32 [2018-12-31 09:42:08,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:08,116 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 195 transitions. [2018-12-31 09:42:08,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2018-12-31 09:42:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:08,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:08,119 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:08,123 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1370081918, now seen corresponding path program 1 times [2018-12-31 09:42:08,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:08,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:08,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:08,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:08,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:08,397 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,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:08,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:42:08,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:42:08,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:42:08,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:42:08,400 INFO L87 Difference]: Start difference. First operand 142 states and 195 transitions. Second operand 6 states. [2018-12-31 09:42:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:08,822 INFO L93 Difference]: Finished difference Result 435 states and 595 transitions. [2018-12-31 09:42:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:42:08,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-12-31 09:42:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:08,829 INFO L225 Difference]: With dead ends: 435 [2018-12-31 09:42:08,829 INFO L226 Difference]: Without dead ends: 300 [2018-12-31 09:42:08,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:42:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-31 09:42:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 146. [2018-12-31 09:42:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-31 09:42:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2018-12-31 09:42:08,858 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 32 [2018-12-31 09:42:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:08,860 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2018-12-31 09:42:08,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:42:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2018-12-31 09:42:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:08,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:08,861 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:08,861 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1956887932, now seen corresponding path program 1 times [2018-12-31 09:42:08,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:08,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:08,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:08,953 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,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:08,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:08,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:08,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:08,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:08,957 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand 3 states. [2018-12-31 09:42:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:09,123 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2018-12-31 09:42:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:09,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-31 09:42:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:09,127 INFO L225 Difference]: With dead ends: 371 [2018-12-31 09:42:09,127 INFO L226 Difference]: Without dead ends: 232 [2018-12-31 09:42:09,127 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:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-12-31 09:42:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-12-31 09:42:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-31 09:42:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 307 transitions. [2018-12-31 09:42:09,180 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 307 transitions. Word has length 32 [2018-12-31 09:42:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:09,183 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 307 transitions. [2018-12-31 09:42:09,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 307 transitions. [2018-12-31 09:42:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:42:09,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:09,185 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:09,185 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash 875175876, now seen corresponding path program 1 times [2018-12-31 09:42:09,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:09,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:09,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:09,307 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,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:09,309 INFO L87 Difference]: Start difference. First operand 232 states and 307 transitions. Second operand 3 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 315 states and 418 transitions. [2018-12-31 09:42:09,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:09,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-31 09:42:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:09,489 INFO L225 Difference]: With dead ends: 315 [2018-12-31 09:42:09,490 INFO L226 Difference]: Without dead ends: 313 [2018-12-31 09:42:09,490 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:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-31 09:42:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2018-12-31 09:42:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-31 09:42:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2018-12-31 09:42:09,574 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 33 [2018-12-31 09:42:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:09,575 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2018-12-31 09:42:09,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2018-12-31 09:42:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:42:09,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:09,579 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:09,579 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1646221848, now seen corresponding path program 1 times [2018-12-31 09:42:09,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:09,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:10,245 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:42:10,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:42:10 BoogieIcfgContainer [2018-12-31 09:42:10,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:42:10,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:42:10,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:42:10,425 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:42:10,425 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:04" (3/4) ... [2018-12-31 09:42:10,429 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:42:10,562 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:42:10,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:42:10,564 INFO L168 Benchmark]: Toolchain (without parser) took 8225.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 954.0 MB in the beginning and 1.0 GB in the end (delta: -60.5 MB). Peak memory consumption was 159.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:10,565 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:42:10,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:10,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:10,568 INFO L168 Benchmark]: Boogie Preprocessor took 39.93 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:10,568 INFO L168 Benchmark]: RCFGBuilder took 1356.56 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: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:10,568 INFO L168 Benchmark]: TraceAbstraction took 5892.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.0 MB). Peak memory consumption was 106.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:10,569 INFO L168 Benchmark]: Witness Printer took 138.86 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:10,573 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 719.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.93 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 1356.56 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: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5892.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.0 MB). Peak memory consumption was 106.1 MB. Max. memory is 11.5 GB. * Witness Printer took 138.86 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 736]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L416] int pumpRunning = 0; [L417] int systemActive = 1; [L655] int methAndRunningLastTime ; [L741] int cleanupTimeShifts = 4; [L839] int waterLevel = 1; [L840] int methaneLevelCritical = 0; [L815] int retValue_acc ; [L816] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L723] int retValue_acc ; [L726] retValue_acc = 1 [L727] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L822] tmp = valid_product() [L824] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L660] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L588] int splverifierCounter ; [L589] int tmp ; [L590] int tmp___0 ; [L591] int tmp___1 ; [L592] int tmp___2 ; [L595] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L597] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L599] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L605] tmp = __VERIFIER_nondet_int() [L607] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L857] COND TRUE waterLevel < 2 [L858] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L615] tmp___0 = __VERIFIER_nondet_int() [L617] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L869] COND FALSE !(\read(methaneLevelCritical)) [L872] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L625] tmp___2 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L424] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L431] COND TRUE \read(systemActive) [L453] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L456] COND TRUE ! pumpRunning [L550] int retValue_acc ; [L551] int tmp ; [L552] int tmp___0 ; [L919] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L922] COND FALSE !(waterLevel < 2) [L926] retValue_acc = 0 [L927] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L556] tmp = isHighWaterSensorDry() [L558] COND FALSE !(\read(tmp)) [L561] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L563] retValue_acc = tmp___0 [L564] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L458] tmp = isHighWaterLevel() [L460] COND TRUE \read(tmp) [L481] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L665] int tmp ; [L666] int tmp___0 ; [L878] int retValue_acc ; [L881] retValue_acc = methaneLevelCritical [L882] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L670] tmp = isMethaneLevelCritical() [L672] COND TRUE \read(tmp) [L505] int retValue_acc ; [L508] retValue_acc = pumpRunning [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L674] tmp___0 = isPumpRunning() [L676] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L677] COND FALSE !(\read(methAndRunningLastTime)) [L682] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L597] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L599] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L605] tmp = __VERIFIER_nondet_int() [L607] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L615] tmp___0 = __VERIFIER_nondet_int() [L617] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L625] tmp___2 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L424] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L845] COND TRUE waterLevel > 0 [L846] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L431] COND TRUE \read(systemActive) [L453] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L456] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L665] int tmp ; [L666] int tmp___0 ; [L878] int retValue_acc ; [L881] retValue_acc = methaneLevelCritical [L882] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L670] tmp = isMethaneLevelCritical() [L672] COND TRUE \read(tmp) [L505] int retValue_acc ; [L508] retValue_acc = pumpRunning [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L674] tmp___0 = isPumpRunning() [L676] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L677] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L736] __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.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 708 SDtfs, 995 SDslu, 1212 SDs, 0 SdLazy, 134 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred 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, 753 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 14762 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...