./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product42_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_product42_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 ea28f55a4b6a2303e55c14d7dbcddcf1e8db1491 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:10,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:42:10,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:42:10,858 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:42:10,858 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:42:10,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:42:10,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:42:10,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:42:10,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:42:10,865 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:42:10,866 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:42:10,866 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:42:10,867 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:42:10,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:42:10,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:42:10,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:42:10,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:42:10,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:42:10,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:42:10,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:42:10,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:42:10,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:42:10,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:42:10,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:42:10,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:42:10,883 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:42:10,884 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:42:10,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:42:10,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:42:10,887 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:42:10,887 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:42:10,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:42:10,888 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:42:10,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:42:10,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:42:10,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:42:10,891 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:10,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:42:10,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:42:10,908 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:42:10,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:42:10,908 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:42:10,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:42:10,909 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:42:10,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:42:10,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:42:10,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:42:10,909 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:42:10,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:42:10,910 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:42:10,910 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:42:10,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:42:10,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:42:10,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:42:10,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:42:10,911 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:42:10,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:42:10,911 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:42:10,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:42:10,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:42:10,912 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:42:10,912 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:42:10,912 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:42:10,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:42:10,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:42:10,913 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 -> ea28f55a4b6a2303e55c14d7dbcddcf1e8db1491 [2018-12-31 09:42:10,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:42:10,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:42:10,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:42:10,966 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:42:10,966 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:42:10,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product42_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:11,042 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45e0c8e9/2ac5029a04904a78ad1b0c0b6eb0b628/FLAG35a47fb14 [2018-12-31 09:42:11,544 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:42:11,545 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product42_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:11,564 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45e0c8e9/2ac5029a04904a78ad1b0c0b6eb0b628/FLAG35a47fb14 [2018-12-31 09:42:12,045 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45e0c8e9/2ac5029a04904a78ad1b0c0b6eb0b628 [2018-12-31 09:42:12,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:42:12,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:42:12,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:12,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:42:12,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:42:12,062 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,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71fd2bd4 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,065 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,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:42:12,144 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:42:12,499 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:12,519 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:42:12,688 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:12,734 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:42:12,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:12 WrapperNode [2018-12-31 09:42:12,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:12,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:12,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:42:12,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:42:12,746 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:12" (1/1) ... [2018-12-31 09:42:12,766 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:12" (1/1) ... [2018-12-31 09:42:12,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:12,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:42:12,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:42:12,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:42:12,821 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:12" (1/1) ... [2018-12-31 09:42:12,821 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:12" (1/1) ... [2018-12-31 09:42:12,826 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:12" (1/1) ... [2018-12-31 09:42:12,826 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:12" (1/1) ... [2018-12-31 09:42:12,840 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:12" (1/1) ... [2018-12-31 09:42:12,849 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:12" (1/1) ... [2018-12-31 09:42:12,852 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:12" (1/1) ... [2018-12-31 09:42:12,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:42:12,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:42:12,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:42:12,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:42:12,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:12" (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:12,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:42:12,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:42:12,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:42:12,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:42:14,353 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:42:14,353 INFO L280 CfgBuilder]: Removed 118 assue(true) statements. [2018-12-31 09:42:14,354 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,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:42:14,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:42:14,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:42:14,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:42:14,360 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,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1265c2f7 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,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:12" (2/3) ... [2018-12-31 09:42:14,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1265c2f7 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,361 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,364 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product42_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:14,374 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:42:14,382 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:42:14,397 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:42:14,428 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:42:14,429 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:42:14,429 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:42:14,429 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:42:14,430 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:42:14,430 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:42:14,430 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:42:14,430 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:42:14,430 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:42:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-12-31 09:42:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 09:42:14,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:14,457 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:14,460 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1607383533, now seen corresponding path program 1 times [2018-12-31 09:42:14,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:14,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:14,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:14,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:14,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:14,757 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:14,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:14,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:14,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:42:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:42:14,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:42:14,781 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-12-31 09:42:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:14,822 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2018-12-31 09:42:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:42:14,824 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 09:42:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:14,843 INFO L225 Difference]: With dead ends: 175 [2018-12-31 09:42:14,843 INFO L226 Difference]: Without dead ends: 87 [2018-12-31 09:42:14,848 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:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-31 09:42:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-31 09:42:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-31 09:42:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2018-12-31 09:42:14,909 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 18 [2018-12-31 09:42:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:14,910 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2018-12-31 09:42:14,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:42:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2018-12-31 09:42:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:42:14,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:14,912 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:14,913 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1734754371, now seen corresponding path program 1 times [2018-12-31 09:42:14,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:14,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:14,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:14,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:14,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:15,127 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,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:15,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:15,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:15,136 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 3 states. [2018-12-31 09:42:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:15,170 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2018-12-31 09:42:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:15,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 09:42:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:15,173 INFO L225 Difference]: With dead ends: 87 [2018-12-31 09:42:15,173 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 09:42:15,175 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,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 09:42:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-31 09:42:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 09:42:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2018-12-31 09:42:15,187 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 19 [2018-12-31 09:42:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:15,188 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2018-12-31 09:42:15,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2018-12-31 09:42:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:42:15,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:15,189 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,190 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1107356745, now seen corresponding path program 1 times [2018-12-31 09:42:15,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:15,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:15,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:15,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:15,330 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,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:15,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:15,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:15,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:15,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:15,332 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2018-12-31 09:42:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:15,384 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2018-12-31 09:42:15,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:15,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:42:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:15,386 INFO L225 Difference]: With dead ends: 71 [2018-12-31 09:42:15,386 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 09:42:15,387 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,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 09:42:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-31 09:42:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 09:42:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2018-12-31 09:42:15,394 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 24 [2018-12-31 09:42:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:15,394 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-12-31 09:42:15,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2018-12-31 09:42:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:42:15,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:15,396 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:15,396 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:15,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1414852999, now seen corresponding path program 1 times [2018-12-31 09:42:15,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:15,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:15,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:15,540 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,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:15,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:15,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:15,545 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 3 states. [2018-12-31 09:42:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:15,719 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2018-12-31 09:42:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:15,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:42:15,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:15,721 INFO L225 Difference]: With dead ends: 93 [2018-12-31 09:42:15,722 INFO L226 Difference]: Without dead ends: 61 [2018-12-31 09:42:15,722 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:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-31 09:42:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-31 09:42:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-31 09:42:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2018-12-31 09:42:15,744 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 25 [2018-12-31 09:42:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:15,744 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2018-12-31 09:42:15,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2018-12-31 09:42:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:42:15,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:15,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] [2018-12-31 09:42:15,750 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:15,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1390046811, now seen corresponding path program 1 times [2018-12-31 09:42:15,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:15,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:15,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:15,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:16,042 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,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:16,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:16,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:16,045 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 5 states. [2018-12-31 09:42:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:16,615 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2018-12-31 09:42:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:42:16,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:42:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:16,620 INFO L225 Difference]: With dead ends: 271 [2018-12-31 09:42:16,620 INFO L226 Difference]: Without dead ends: 219 [2018-12-31 09:42:16,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-31 09:42:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 103. [2018-12-31 09:42:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-31 09:42:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2018-12-31 09:42:16,646 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 31 [2018-12-31 09:42:16,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:16,647 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2018-12-31 09:42:16,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2018-12-31 09:42:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:16,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:16,648 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:16,649 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:16,649 INFO L82 PathProgramCache]: Analyzing trace with hash 272516125, now seen corresponding path program 1 times [2018-12-31 09:42:16,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:16,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:16,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:16,793 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,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:16,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:16,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:16,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:16,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:16,795 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand 5 states. [2018-12-31 09:42:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:17,334 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2018-12-31 09:42:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:42:17,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:42:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:17,338 INFO L225 Difference]: With dead ends: 376 [2018-12-31 09:42:17,338 INFO L226 Difference]: Without dead ends: 280 [2018-12-31 09:42:17,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-31 09:42:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 102. [2018-12-31 09:42:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-31 09:42:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2018-12-31 09:42:17,361 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 32 [2018-12-31 09:42:17,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:17,361 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2018-12-31 09:42:17,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2018-12-31 09:42:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:17,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:17,363 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,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -824557763, now seen corresponding path program 1 times [2018-12-31 09:42:17,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:17,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:17,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:17,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:17,641 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,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:17,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:17,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:17,646 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand 5 states. [2018-12-31 09:42:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:18,002 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2018-12-31 09:42:18,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:18,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-31 09:42:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:18,005 INFO L225 Difference]: With dead ends: 273 [2018-12-31 09:42:18,006 INFO L226 Difference]: Without dead ends: 178 [2018-12-31 09:42:18,007 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,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-31 09:42:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2018-12-31 09:42:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-31 09:42:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2018-12-31 09:42:18,026 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 35 [2018-12-31 09:42:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:18,027 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2018-12-31 09:42:18,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2018-12-31 09:42:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:18,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:18,030 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,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1835675013, now seen corresponding path program 1 times [2018-12-31 09:42:18,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:18,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:18,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:18,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:18,179 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,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:18,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:18,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:42:18,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:42:18,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:42:18,181 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 4 states. [2018-12-31 09:42:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:18,280 INFO L93 Difference]: Finished difference Result 255 states and 347 transitions. [2018-12-31 09:42:18,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:42:18,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-31 09:42:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:18,283 INFO L225 Difference]: With dead ends: 255 [2018-12-31 09:42:18,283 INFO L226 Difference]: Without dead ends: 154 [2018-12-31 09:42:18,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-31 09:42:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 112. [2018-12-31 09:42:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-31 09:42:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2018-12-31 09:42:18,304 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 35 [2018-12-31 09:42:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:18,305 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2018-12-31 09:42:18,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:42:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2018-12-31 09:42:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:18,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:18,307 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,307 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1438223929, now seen corresponding path program 1 times [2018-12-31 09:42:18,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:18,386 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,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:18,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:18,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:18,388 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand 3 states. [2018-12-31 09:42:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:18,547 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2018-12-31 09:42:18,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:18,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-31 09:42:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:18,550 INFO L225 Difference]: With dead ends: 265 [2018-12-31 09:42:18,551 INFO L226 Difference]: Without dead ends: 160 [2018-12-31 09:42:18,551 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,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-31 09:42:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-31 09:42:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-31 09:42:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2018-12-31 09:42:18,592 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 35 [2018-12-31 09:42:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:18,595 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2018-12-31 09:42:18,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2018-12-31 09:42:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:42:18,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:18,597 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:18,597 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1113565433, now seen corresponding path program 1 times [2018-12-31 09:42:18,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:18,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:18,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:18,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:18,978 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,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:18,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:42:18,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:42:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:42:18,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:42:18,980 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 6 states. [2018-12-31 09:42:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:20,460 INFO L93 Difference]: Finished difference Result 485 states and 635 transitions. [2018-12-31 09:42:20,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:42:20,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-31 09:42:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:20,463 INFO L225 Difference]: With dead ends: 485 [2018-12-31 09:42:20,464 INFO L226 Difference]: Without dead ends: 332 [2018-12-31 09:42:20,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:42:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-31 09:42:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 160. [2018-12-31 09:42:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-31 09:42:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2018-12-31 09:42:20,496 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 36 [2018-12-31 09:42:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:20,498 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2018-12-31 09:42:20,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:42:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2018-12-31 09:42:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:42:20,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:20,499 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:20,501 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1527108990, now seen corresponding path program 1 times [2018-12-31 09:42:20,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:20,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:20,583 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:20,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:20,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:20,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:20,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:20,585 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 3 states. [2018-12-31 09:42:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:20,740 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2018-12-31 09:42:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:20,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 09:42:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:20,743 INFO L225 Difference]: With dead ends: 233 [2018-12-31 09:42:20,743 INFO L226 Difference]: Without dead ends: 231 [2018-12-31 09:42:20,743 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:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-31 09:42:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2018-12-31 09:42:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-31 09:42:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2018-12-31 09:42:20,774 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 51 [2018-12-31 09:42:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:20,774 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2018-12-31 09:42:20,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2018-12-31 09:42:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 09:42:20,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:20,775 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:20,776 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash 338659975, now seen corresponding path program 1 times [2018-12-31 09:42:20,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:20,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:21,495 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:42:21,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:42:21 BoogieIcfgContainer [2018-12-31 09:42:21,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:42:21,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:42:21,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:42:21,658 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:42:21,659 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:21,661 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:42:21,824 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:42:21,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:42:21,826 INFO L168 Benchmark]: Toolchain (without parser) took 9775.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 946.0 MB in the beginning and 965.0 MB in the end (delta: -19.0 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:21,828 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:42:21,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:21,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.25 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:21,829 INFO L168 Benchmark]: Boogie Preprocessor took 45.38 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:21,829 INFO L168 Benchmark]: RCFGBuilder took 1497.49 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:21,829 INFO L168 Benchmark]: TraceAbstraction took 7301.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 996.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:21,830 INFO L168 Benchmark]: Witness Printer took 167.28 ms. Allocated memory is still 1.2 GB. Free memory was 996.5 MB in the beginning and 965.0 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:21,832 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 682.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.38 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1497.49 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7301.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 996.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. * Witness Printer took 167.28 ms. Allocated memory is still 1.2 GB. Free memory was 996.5 MB in the beginning and 965.0 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 844]: 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; [L486] int pumpRunning = 0; [L487] int systemActive = 1; [L666] int methAndRunningLastTime ; [L743] int cleanupTimeShifts = 4; [L850] int waterLevel = 1; [L851] int methaneLevelCritical = 0; [L817] int retValue_acc ; [L818] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L734] int retValue_acc ; [L737] retValue_acc = 1 [L738] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] tmp = valid_product() [L826] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L671] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L412] int splverifierCounter ; [L413] int tmp ; [L414] int tmp___0 ; [L415] int tmp___1 ; [L416] int tmp___2 ; [L419] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L429] tmp = __VERIFIER_nondet_int() [L431] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L868] COND TRUE waterLevel < 2 [L869] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L494] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L526] COND TRUE ! pumpRunning [L638] int retValue_acc ; [L639] int tmp ; [L640] int tmp___0 ; [L930] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L933] COND FALSE !(waterLevel < 2) [L937] retValue_acc = 0 [L938] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L644] tmp = isHighWaterSensorDry() [L646] COND FALSE !(\read(tmp)) [L649] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L651] retValue_acc = tmp___0 [L652] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L528] tmp = isHighWaterLevel() [L530] COND TRUE \read(tmp) [L557] int tmp ; [L582] int retValue_acc ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L586] retValue_acc = isMethaneLevelCritical() [L588] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L561] tmp = isMethaneAlarm() [L563] COND FALSE !(\read(tmp)) [L551] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L681] tmp = isMethaneLevelCritical() [L683] COND FALSE !(\read(tmp)) [L699] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L429] tmp = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] COND FALSE !(\read(methaneLevelCritical)) [L883] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L494] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L856] COND TRUE waterLevel > 0 [L857] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L526] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L681] tmp = isMethaneLevelCritical() [L683] COND TRUE \read(tmp) [L593] int retValue_acc ; [L596] retValue_acc = pumpRunning [L597] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L685] tmp___0 = isPumpRunning() [L687] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L688] COND FALSE !(\read(methAndRunningLastTime)) [L693] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L429] tmp = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L494] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L856] COND TRUE waterLevel > 0 [L857] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L526] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L681] tmp = isMethaneLevelCritical() [L683] COND TRUE \read(tmp) [L593] int retValue_acc ; [L596] retValue_acc = pumpRunning [L597] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L685] tmp___0 = isPumpRunning() [L687] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L688] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L844] __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, 91 locations, 3 error locations. UNSAFE Result, 7.2s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 837 SDtfs, 942 SDslu, 1280 SDs, 0 SdLazy, 171 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 631 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 19622 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...