./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product43_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_product43_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 d3ef47dc64404f2fae365adb4fa9379fd10f9c50 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:11,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:42:11,427 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:42:11,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:42:11,440 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:42:11,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:42:11,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:42:11,448 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:42:11,450 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:42:11,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:42:11,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:42:11,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:42:11,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:42:11,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:42:11,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:42:11,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:42:11,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:42:11,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:42:11,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:42:11,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:42:11,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:42:11,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:42:11,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:42:11,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:42:11,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:42:11,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:42:11,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:42:11,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:42:11,473 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:42:11,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:42:11,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:42:11,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:42:11,480 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:42:11,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:42:11,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:42:11,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:42:11,482 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:11,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:42:11,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:42:11,508 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:42:11,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:42:11,508 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:42:11,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:42:11,509 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:42:11,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:42:11,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:42:11,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:42:11,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:42:11,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:42:11,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:42:11,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:42:11,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:42:11,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:42:11,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:42:11,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:42:11,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:42:11,513 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:42:11,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:42:11,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:42:11,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:42:11,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:42:11,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:42:11,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:42:11,515 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:42:11,515 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:42:11,515 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 -> d3ef47dc64404f2fae365adb4fa9379fd10f9c50 [2018-12-31 09:42:11,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:42:11,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:42:11,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:42:11,589 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:42:11,589 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:42:11,591 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product43_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:11,657 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbad3ab7/c9e10d8f417c4a98b0439ce4107bafaa/FLAG5e8c034e0 [2018-12-31 09:42:12,181 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:42:12,181 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product43_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:12,198 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbad3ab7/c9e10d8f417c4a98b0439ce4107bafaa/FLAG5e8c034e0 [2018-12-31 09:42:12,460 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbad3ab7/c9e10d8f417c4a98b0439ce4107bafaa [2018-12-31 09:42:12,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:42:12,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:42:12,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:12,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:42:12,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:42:12,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:12" (1/1) ... [2018-12-31 09:42:12,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:12, skipping insertion in model container [2018-12-31 09:42:12,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:12" (1/1) ... [2018-12-31 09:42:12,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:42:12,547 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:42:12,929 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:12,944 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:42:13,057 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:13,196 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:42:13,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:13 WrapperNode [2018-12-31 09:42:13,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:13,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:13,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:42:13,198 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:42:13,209 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:13" (1/1) ... [2018-12-31 09:42:13,236 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:13" (1/1) ... [2018-12-31 09:42:13,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:13,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:42:13,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:42:13,293 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:42:13,307 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:13" (1/1) ... [2018-12-31 09:42:13,307 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:13" (1/1) ... [2018-12-31 09:42:13,312 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:13" (1/1) ... [2018-12-31 09:42:13,312 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:13" (1/1) ... [2018-12-31 09:42:13,334 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:13" (1/1) ... [2018-12-31 09:42:13,344 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:13" (1/1) ... [2018-12-31 09:42:13,355 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:13" (1/1) ... [2018-12-31 09:42:13,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:42:13,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:42:13,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:42:13,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:42:13,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:13" (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:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:42:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:42:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:42:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:42:14,888 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:42:14,889 INFO L280 CfgBuilder]: Removed 120 assue(true) statements. [2018-12-31 09:42:14,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:14 BoogieIcfgContainer [2018-12-31 09:42:14,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:42:14,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:42:14,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:42:14,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:42:14,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:42:12" (1/3) ... [2018-12-31 09:42:14,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a83815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:14, skipping insertion in model container [2018-12-31 09:42:14,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:13" (2/3) ... [2018-12-31 09:42:14,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a83815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:14, skipping insertion in model container [2018-12-31 09:42:14,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:14" (3/3) ... [2018-12-31 09:42:14,900 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product43_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:14,911 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:42:14,921 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:42:14,940 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:42:14,973 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:42:14,974 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:42:14,974 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:42:14,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:42:14,975 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:42:14,975 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:42:14,975 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:42:14,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:42:14,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:42:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2018-12-31 09:42:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 09:42:15,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:15,002 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:15,004 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:15,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1388908220, now seen corresponding path program 1 times [2018-12-31 09:42:15,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:15,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:15,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:15,275 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:15,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:15,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:15,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:42:15,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:42:15,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:42:15,302 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2018-12-31 09:42:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:15,340 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2018-12-31 09:42:15,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:42:15,342 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 09:42:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:15,354 INFO L225 Difference]: With dead ends: 179 [2018-12-31 09:42:15,354 INFO L226 Difference]: Without dead ends: 89 [2018-12-31 09:42:15,358 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:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-31 09:42:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-31 09:42:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-31 09:42:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2018-12-31 09:42:15,404 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2018-12-31 09:42:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:15,405 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2018-12-31 09:42:15,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:42:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2018-12-31 09:42:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:42:15,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:15,407 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:15,407 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:15,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1607744189, now seen corresponding path program 1 times [2018-12-31 09:42:15,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:15,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:15,578 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:15,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:15,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:15,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:15,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:15,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:15,582 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2018-12-31 09:42:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:15,608 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2018-12-31 09:42:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:15,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 09:42:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:15,610 INFO L225 Difference]: With dead ends: 89 [2018-12-31 09:42:15,610 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 09:42:15,612 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:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 09:42:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 09:42:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 09:42:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2018-12-31 09:42:15,620 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2018-12-31 09:42:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:15,620 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2018-12-31 09:42:15,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2018-12-31 09:42:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:42:15,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:15,622 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:15,623 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1417220031, now seen corresponding path program 1 times [2018-12-31 09:42:15,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:15,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:15,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:15,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:15,899 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:15,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:15,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:15,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:42:15,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:42:15,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:42:15,901 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 6 states. [2018-12-31 09:42:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:16,091 INFO L93 Difference]: Finished difference Result 133 states and 196 transitions. [2018-12-31 09:42:16,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:16,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-31 09:42:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:16,094 INFO L225 Difference]: With dead ends: 133 [2018-12-31 09:42:16,094 INFO L226 Difference]: Without dead ends: 99 [2018-12-31 09:42:16,095 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:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-31 09:42:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2018-12-31 09:42:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-31 09:42:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2018-12-31 09:42:16,110 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 24 [2018-12-31 09:42:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:16,111 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2018-12-31 09:42:16,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:42:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2018-12-31 09:42:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:42:16,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:16,113 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:16,114 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash -462384263, now seen corresponding path program 1 times [2018-12-31 09:42:16,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:16,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:16,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:16,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:16,220 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:16,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:16,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:16,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:16,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:16,223 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand 3 states. [2018-12-31 09:42:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:16,411 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2018-12-31 09:42:16,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:16,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:42:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:16,413 INFO L225 Difference]: With dead ends: 137 [2018-12-31 09:42:16,413 INFO L226 Difference]: Without dead ends: 83 [2018-12-31 09:42:16,414 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:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-31 09:42:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-12-31 09:42:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-31 09:42:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2018-12-31 09:42:16,427 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 25 [2018-12-31 09:42:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:16,428 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2018-12-31 09:42:16,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2018-12-31 09:42:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 09:42:16,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:16,429 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:16,430 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1738728008, now seen corresponding path program 1 times [2018-12-31 09:42:16,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:16,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:16,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:16,551 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:16,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:16,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:16,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:16,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:16,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:16,554 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 5 states. [2018-12-31 09:42:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:16,851 INFO L93 Difference]: Finished difference Result 378 states and 552 transitions. [2018-12-31 09:42:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:42:16,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-31 09:42:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:16,857 INFO L225 Difference]: With dead ends: 378 [2018-12-31 09:42:16,859 INFO L226 Difference]: Without dead ends: 304 [2018-12-31 09:42:16,860 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:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-31 09:42:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 144. [2018-12-31 09:42:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-31 09:42:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2018-12-31 09:42:16,917 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 27 [2018-12-31 09:42:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:16,922 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2018-12-31 09:42:16,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2018-12-31 09:42:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 09:42:16,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:16,924 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:16,924 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:16,927 INFO L82 PathProgramCache]: Analyzing trace with hash 304582848, now seen corresponding path program 1 times [2018-12-31 09:42:16,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:17,072 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:17,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:17,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:17,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:17,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:17,075 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand 5 states. [2018-12-31 09:42:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:17,712 INFO L93 Difference]: Finished difference Result 529 states and 751 transitions. [2018-12-31 09:42:17,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:42:17,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-31 09:42:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:17,715 INFO L225 Difference]: With dead ends: 529 [2018-12-31 09:42:17,715 INFO L226 Difference]: Without dead ends: 392 [2018-12-31 09:42:17,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-31 09:42:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 142. [2018-12-31 09:42:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-31 09:42:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2018-12-31 09:42:17,747 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 28 [2018-12-31 09:42:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:17,747 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2018-12-31 09:42:17,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2018-12-31 09:42:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:17,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:17,750 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, 1, 1] [2018-12-31 09:42:17,750 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1643402821, now seen corresponding path program 1 times [2018-12-31 09:42:17,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:17,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:17,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:17,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:17,933 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:17,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:17,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:17,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:17,937 INFO L87 Difference]: Start difference. First operand 142 states and 197 transitions. Second operand 5 states. [2018-12-31 09:42:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:18,382 INFO L93 Difference]: Finished difference Result 429 states and 593 transitions. [2018-12-31 09:42:18,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:18,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-31 09:42:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:18,386 INFO L225 Difference]: With dead ends: 429 [2018-12-31 09:42:18,386 INFO L226 Difference]: Without dead ends: 294 [2018-12-31 09:42:18,387 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:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-31 09:42:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 148. [2018-12-31 09:42:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-31 09:42:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2018-12-31 09:42:18,421 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 35 [2018-12-31 09:42:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:18,421 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2018-12-31 09:42:18,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2018-12-31 09:42:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:18,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:18,428 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, 1, 1] [2018-12-31 09:42:18,428 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:18,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash 632285571, now seen corresponding path program 1 times [2018-12-31 09:42:18,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:18,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:18,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:18,569 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:18,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:18,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:18,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:42:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:42:18,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:42:18,570 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand 4 states. [2018-12-31 09:42:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:18,698 INFO L93 Difference]: Finished difference Result 373 states and 511 transitions. [2018-12-31 09:42:18,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:42:18,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-31 09:42:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:18,703 INFO L225 Difference]: With dead ends: 373 [2018-12-31 09:42:18,703 INFO L226 Difference]: Without dead ends: 232 [2018-12-31 09:42:18,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-12-31 09:42:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2018-12-31 09:42:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-31 09:42:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2018-12-31 09:42:18,730 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 35 [2018-12-31 09:42:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:18,730 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2018-12-31 09:42:18,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:42:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2018-12-31 09:42:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:18,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:18,737 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, 1, 1] [2018-12-31 09:42:18,737 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:18,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:18,737 INFO L82 PathProgramCache]: Analyzing trace with hash -388782783, now seen corresponding path program 1 times [2018-12-31 09:42:18,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:18,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:18,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:18,831 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:18,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:18,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:18,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:18,833 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 3 states. [2018-12-31 09:42:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:18,991 INFO L93 Difference]: Finished difference Result 383 states and 521 transitions. [2018-12-31 09:42:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:18,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-31 09:42:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:18,993 INFO L225 Difference]: With dead ends: 383 [2018-12-31 09:42:18,993 INFO L226 Difference]: Without dead ends: 238 [2018-12-31 09:42:18,994 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:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-31 09:42:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-12-31 09:42:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-12-31 09:42:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2018-12-31 09:42:19,038 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 35 [2018-12-31 09:42:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:19,038 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2018-12-31 09:42:19,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2018-12-31 09:42:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:42:19,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:19,040 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, 1, 1, 1] [2018-12-31 09:42:19,040 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:19,040 INFO L82 PathProgramCache]: Analyzing trace with hash -713441279, now seen corresponding path program 1 times [2018-12-31 09:42:19,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:19,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:19,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:19,209 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:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 09:42:19,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:42:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:42:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:42:19,211 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 8 states. [2018-12-31 09:42:19,730 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 09:42:20,158 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 09:42:20,902 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 09:42:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:21,427 INFO L93 Difference]: Finished difference Result 877 states and 1165 transitions. [2018-12-31 09:42:21,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 09:42:21,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-31 09:42:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:21,431 INFO L225 Difference]: With dead ends: 877 [2018-12-31 09:42:21,431 INFO L226 Difference]: Without dead ends: 646 [2018-12-31 09:42:21,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2018-12-31 09:42:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-12-31 09:42:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 238. [2018-12-31 09:42:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-12-31 09:42:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 309 transitions. [2018-12-31 09:42:21,472 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 309 transitions. Word has length 36 [2018-12-31 09:42:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:21,472 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 309 transitions. [2018-12-31 09:42:21,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:42:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 309 transitions. [2018-12-31 09:42:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:42:21,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:21,476 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:21,477 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash -838060658, now seen corresponding path program 1 times [2018-12-31 09:42:21,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:21,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:21,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:21,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:21,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:21,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:21,570 INFO L87 Difference]: Start difference. First operand 238 states and 309 transitions. Second operand 3 states. [2018-12-31 09:42:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:21,728 INFO L93 Difference]: Finished difference Result 327 states and 426 transitions. [2018-12-31 09:42:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:21,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 09:42:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:21,732 INFO L225 Difference]: With dead ends: 327 [2018-12-31 09:42:21,732 INFO L226 Difference]: Without dead ends: 325 [2018-12-31 09:42:21,732 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:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-31 09:42:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 258. [2018-12-31 09:42:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-12-31 09:42:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2018-12-31 09:42:21,784 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 51 [2018-12-31 09:42:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:21,784 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2018-12-31 09:42:21,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2018-12-31 09:42:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 09:42:21,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:21,787 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-31 09:42:21,787 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1134302103, now seen corresponding path program 1 times [2018-12-31 09:42:21,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:21,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:22,410 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:42:22,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:42:22 BoogieIcfgContainer [2018-12-31 09:42:22,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:42:22,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:42:22,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:42:22,626 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:42:22,628 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:14" (3/4) ... [2018-12-31 09:42:22,631 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:42:22,813 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:42:22,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:42:22,814 INFO L168 Benchmark]: Toolchain (without parser) took 10349.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 948.7 MB in the beginning and 887.6 MB in the end (delta: 61.0 MB). Peak memory consumption was 252.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:22,815 INFO L168 Benchmark]: CDTParser took 0.20 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:22,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:22,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:22,816 INFO L168 Benchmark]: Boogie Preprocessor took 68.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:42:22,817 INFO L168 Benchmark]: RCFGBuilder took 1530.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:22,817 INFO L168 Benchmark]: TraceAbstraction took 7734.40 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 920.3 MB in the end (delta: 120.4 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:22,817 INFO L168 Benchmark]: Witness Printer took 186.97 ms. Allocated memory is still 1.2 GB. Free memory was 920.3 MB in the beginning and 887.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:22,826 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.20 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 730.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1530.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7734.40 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 920.3 MB in the end (delta: 120.4 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. * Witness Printer took 186.97 ms. Allocated memory is still 1.2 GB. Free memory was 920.3 MB in the beginning and 887.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 946]: 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; [L507] int cleanupTimeShifts = 4; [L648] int methAndRunningLastTime ; [L757] int pumpRunning = 0; [L758] int systemActive = 1; [L588] int retValue_acc ; [L589] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L637] int retValue_acc ; [L640] retValue_acc = 1 [L641] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L595] tmp = valid_product() [L597] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L653] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L689] int splverifierCounter ; [L690] int tmp ; [L691] int tmp___0 ; [L692] int tmp___1 ; [L693] int tmp___2 ; [L696] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L706] tmp = __VERIFIER_nondet_int() [L708] 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] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L764] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L796] COND TRUE ! pumpRunning [L908] int retValue_acc ; [L909] int tmp ; [L910] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, 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=0, pumpRunning=0, systemActive=1, waterLevel=2] [L914] tmp = isHighWaterSensorDry() [L916] COND FALSE !(\read(tmp)) [L919] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L921] retValue_acc = tmp___0 [L922] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L798] tmp = isHighWaterLevel() [L800] COND TRUE \read(tmp) [L827] int tmp ; [L852] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L856] retValue_acc = isMethaneLevelCritical() [L858] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L831] tmp = isMethaneAlarm() [L833] COND FALSE !(\read(tmp)) [L821] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L658] int tmp ; [L659] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L663] tmp = isMethaneLevelCritical() [L665] COND FALSE !(\read(tmp)) [L681] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L706] tmp = __VERIFIER_nondet_int() [L708] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L764] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L796] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L658] int tmp ; [L659] 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=1] [L663] tmp = isMethaneLevelCritical() [L665] COND TRUE \read(tmp) [L863] int retValue_acc ; [L866] retValue_acc = pumpRunning [L867] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L667] tmp___0 = isPumpRunning() [L669] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L670] COND FALSE !(\read(methAndRunningLastTime)) [L675] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L706] tmp = __VERIFIER_nondet_int() [L708] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L764] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L796] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L658] int tmp ; [L659] 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=0] [L663] tmp = isMethaneLevelCritical() [L665] COND TRUE \read(tmp) [L863] int retValue_acc ; [L866] retValue_acc = pumpRunning [L867] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L667] tmp___0 = isPumpRunning() [L669] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L670] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L946] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 93 locations, 3 error locations. UNSAFE Result, 7.6s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 944 SDtfs, 1258 SDslu, 1857 SDs, 0 SdLazy, 217 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=11, 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, 11 MinimizatonAttempts, 1151 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 19852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...