./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer --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 b18fc9f0044b48e81511337a91deb94a0dfeec26 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-10-22 08:57:23,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:23,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:23,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:23,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:23,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:23,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:23,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:23,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:23,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:23,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:23,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:23,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:23,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:23,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:23,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:23,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:23,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:23,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:23,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:23,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:23,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:23,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:23,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:23,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:23,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:23,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:23,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:23,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:23,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:23,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:23,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:23,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:23,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:23,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:23,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:23,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:23,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:23,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:23,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:23,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:23,881 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:57:23,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:23,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:23,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:23,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:23,897 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:23,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:23,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:23,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:23,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:23,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:23,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:23,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:23,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:23,909 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:23,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:23,909 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:23,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:23,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:23,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:23,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:23,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:23,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:23,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:23,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:23,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:23,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:23,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:23,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:23,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer 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 -> b18fc9f0044b48e81511337a91deb94a0dfeec26 [2019-10-22 08:57:23,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:23,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:23,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:23,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:23,963 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:23,963 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2019-10-22 08:57:24,019 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/data/be82bd181/59b739d9fb3c4e05876bea428462bc75/FLAG6e957e959 [2019-10-22 08:57:24,445 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:24,446 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2019-10-22 08:57:24,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/data/be82bd181/59b739d9fb3c4e05876bea428462bc75/FLAG6e957e959 [2019-10-22 08:57:24,466 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/data/be82bd181/59b739d9fb3c4e05876bea428462bc75 [2019-10-22 08:57:24,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:24,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:24,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:24,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:24,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:24,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c9b81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24, skipping insertion in model container [2019-10-22 08:57:24,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,483 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:24,513 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:24,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:24,864 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:24,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:24,997 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:24,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24 WrapperNode [2019-10-22 08:57:24,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:24,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:24,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:24,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:25,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:25,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:25,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:25,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:25,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:25,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:25,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:25,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:25,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:25,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/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 [2019-10-22 08:57:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 08:57:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:25,829 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:25,829 INFO L284 CfgBuilder]: Removed 120 assume(true) statements. [2019-10-22 08:57:25,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:25 BoogieIcfgContainer [2019-10-22 08:57:25,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:25,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:25,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:25,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:25,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:24" (1/3) ... [2019-10-22 08:57:25,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eb7471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:25, skipping insertion in model container [2019-10-22 08:57:25,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (2/3) ... [2019-10-22 08:57:25,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eb7471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:25, skipping insertion in model container [2019-10-22 08:57:25,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:25" (3/3) ... [2019-10-22 08:57:25,837 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product44.cil.c [2019-10-22 08:57:25,847 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:25,854 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 08:57:25,862 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 08:57:25,882 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:25,883 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:25,883 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:25,883 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:25,883 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:25,883 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:25,883 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:25,884 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-10-22 08:57:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:57:25,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:25,905 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:25,907 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:25,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1782116946, now seen corresponding path program 1 times [2019-10-22 08:57:25,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193405211] [2019-10-22 08:57:25,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:26,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193405211] [2019-10-22 08:57:26,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:26,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398040646] [2019-10-22 08:57:26,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:57:26,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:57:26,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:57:26,140 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-10-22 08:57:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,167 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-10-22 08:57:26,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:57:26,169 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 08:57:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,179 INFO L225 Difference]: With dead ends: 172 [2019-10-22 08:57:26,179 INFO L226 Difference]: Without dead ends: 85 [2019-10-22 08:57:26,184 INFO L600 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 [2019-10-22 08:57:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-22 08:57:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-10-22 08:57:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 08:57:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-10-22 08:57:26,229 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-10-22 08:57:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:26,229 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-10-22 08:57:26,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:57:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-10-22 08:57:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:57:26,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:26,231 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:26,231 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash 735360049, now seen corresponding path program 1 times [2019-10-22 08:57:26,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339967402] [2019-10-22 08:57:26,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:26,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339967402] [2019-10-22 08:57:26,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:26,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844433232] [2019-10-22 08:57:26,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:26,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:26,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:26,348 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-10-22 08:57:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,361 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-10-22 08:57:26,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:26,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 08:57:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,362 INFO L225 Difference]: With dead ends: 85 [2019-10-22 08:57:26,362 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 08:57:26,363 INFO L600 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 [2019-10-22 08:57:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 08:57:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 08:57:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:57:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-10-22 08:57:26,368 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-10-22 08:57:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:26,369 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-10-22 08:57:26,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-10-22 08:57:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:57:26,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:26,369 INFO L380 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] [2019-10-22 08:57:26,370 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1297648259, now seen corresponding path program 1 times [2019-10-22 08:57:26,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881218083] [2019-10-22 08:57:26,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:26,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881218083] [2019-10-22 08:57:26,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:26,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756434721] [2019-10-22 08:57:26,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:26,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:26,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:26,486 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 5 states. [2019-10-22 08:57:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,560 INFO L93 Difference]: Finished difference Result 95 states and 138 transitions. [2019-10-22 08:57:26,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:26,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-22 08:57:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,561 INFO L225 Difference]: With dead ends: 95 [2019-10-22 08:57:26,561 INFO L226 Difference]: Without dead ends: 62 [2019-10-22 08:57:26,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:57:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-22 08:57:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-10-22 08:57:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 08:57:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-10-22 08:57:26,570 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-10-22 08:57:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:26,571 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-10-22 08:57:26,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-10-22 08:57:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:57:26,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:26,572 INFO L380 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] [2019-10-22 08:57:26,572 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash -372126526, now seen corresponding path program 1 times [2019-10-22 08:57:26,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508735167] [2019-10-22 08:57:26,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:26,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508735167] [2019-10-22 08:57:26,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:26,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555479590] [2019-10-22 08:57:26,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:26,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:26,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:26,659 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-10-22 08:57:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,707 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-10-22 08:57:26,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:26,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:57:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,710 INFO L225 Difference]: With dead ends: 131 [2019-10-22 08:57:26,710 INFO L226 Difference]: Without dead ends: 79 [2019-10-22 08:57:26,710 INFO L600 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 [2019-10-22 08:57:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-22 08:57:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-10-22 08:57:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 08:57:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-10-22 08:57:26,719 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-10-22 08:57:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:26,719 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-10-22 08:57:26,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-10-22 08:57:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:57:26,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:26,720 INFO L380 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] [2019-10-22 08:57:26,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:26,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1852423790, now seen corresponding path program 1 times [2019-10-22 08:57:26,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410366937] [2019-10-22 08:57:26,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:26,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410366937] [2019-10-22 08:57:26,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:26,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733958690] [2019-10-22 08:57:26,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:26,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:26,797 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-10-22 08:57:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,954 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2019-10-22 08:57:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:26,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 08:57:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,958 INFO L225 Difference]: With dead ends: 371 [2019-10-22 08:57:26,958 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 08:57:26,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:57:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 08:57:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 140. [2019-10-22 08:57:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 08:57:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2019-10-22 08:57:27,002 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 25 [2019-10-22 08:57:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,002 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2019-10-22 08:57:27,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2019-10-22 08:57:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:57:27,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,003 INFO L380 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] [2019-10-22 08:57:27,004 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2056230884, now seen corresponding path program 1 times [2019-10-22 08:57:27,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344079399] [2019-10-22 08:57:27,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344079399] [2019-10-22 08:57:27,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:27,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785365176] [2019-10-22 08:57:27,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:27,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:27,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:27,085 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand 5 states. [2019-10-22 08:57:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,200 INFO L93 Difference]: Finished difference Result 392 states and 553 transitions. [2019-10-22 08:57:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:27,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 08:57:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,202 INFO L225 Difference]: With dead ends: 392 [2019-10-22 08:57:27,202 INFO L226 Difference]: Without dead ends: 390 [2019-10-22 08:57:27,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:57:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-22 08:57:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 140. [2019-10-22 08:57:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 08:57:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-10-22 08:57:27,238 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 26 [2019-10-22 08:57:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,238 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-10-22 08:57:27,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-10-22 08:57:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 08:57:27,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,242 INFO L380 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] [2019-10-22 08:57:27,243 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 437867349, now seen corresponding path program 1 times [2019-10-22 08:57:27,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908388898] [2019-10-22 08:57:27,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908388898] [2019-10-22 08:57:27,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:27,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910038678] [2019-10-22 08:57:27,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:27,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:27,312 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 5 states. [2019-10-22 08:57:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,371 INFO L93 Difference]: Finished difference Result 426 states and 588 transitions. [2019-10-22 08:57:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:27,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-22 08:57:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,374 INFO L225 Difference]: With dead ends: 426 [2019-10-22 08:57:27,374 INFO L226 Difference]: Without dead ends: 292 [2019-10-22 08:57:27,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-22 08:57:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2019-10-22 08:57:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 08:57:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2019-10-22 08:57:27,400 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 33 [2019-10-22 08:57:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,401 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2019-10-22 08:57:27,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2019-10-22 08:57:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 08:57:27,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,403 INFO L380 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] [2019-10-22 08:57:27,403 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,403 INFO L82 PathProgramCache]: Analyzing trace with hash -148938665, now seen corresponding path program 1 times [2019-10-22 08:57:27,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847512047] [2019-10-22 08:57:27,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847512047] [2019-10-22 08:57:27,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:27,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614242347] [2019-10-22 08:57:27,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:27,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:27,451 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 4 states. [2019-10-22 08:57:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,518 INFO L93 Difference]: Finished difference Result 370 states and 506 transitions. [2019-10-22 08:57:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:27,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-10-22 08:57:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,519 INFO L225 Difference]: With dead ends: 370 [2019-10-22 08:57:27,519 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 08:57:27,520 INFO L600 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 [2019-10-22 08:57:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 08:57:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2019-10-22 08:57:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-22 08:57:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2019-10-22 08:57:27,536 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 33 [2019-10-22 08:57:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,537 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2019-10-22 08:57:27,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2019-10-22 08:57:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 08:57:27,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,541 INFO L380 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] [2019-10-22 08:57:27,542 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1428802343, now seen corresponding path program 1 times [2019-10-22 08:57:27,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885674524] [2019-10-22 08:57:27,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885674524] [2019-10-22 08:57:27,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:27,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289372927] [2019-10-22 08:57:27,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:27,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:27,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:27,576 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand 3 states. [2019-10-22 08:57:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,603 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2019-10-22 08:57:27,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:27,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 08:57:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,604 INFO L225 Difference]: With dead ends: 380 [2019-10-22 08:57:27,604 INFO L226 Difference]: Without dead ends: 236 [2019-10-22 08:57:27,605 INFO L600 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 [2019-10-22 08:57:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-22 08:57:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-10-22 08:57:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-22 08:57:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 312 transitions. [2019-10-22 08:57:27,625 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 312 transitions. Word has length 33 [2019-10-22 08:57:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,626 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 312 transitions. [2019-10-22 08:57:27,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 312 transitions. [2019-10-22 08:57:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:57:27,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,627 INFO L380 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] [2019-10-22 08:57:27,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash -271506405, now seen corresponding path program 1 times [2019-10-22 08:57:27,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986095450] [2019-10-22 08:57:27,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986095450] [2019-10-22 08:57:27,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:27,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095335380] [2019-10-22 08:57:27,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:27,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:27,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:27,676 INFO L87 Difference]: Start difference. First operand 236 states and 312 transitions. Second operand 6 states. [2019-10-22 08:57:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,857 INFO L93 Difference]: Finished difference Result 726 states and 964 transitions. [2019-10-22 08:57:27,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:57:27,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-10-22 08:57:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,859 INFO L225 Difference]: With dead ends: 726 [2019-10-22 08:57:27,859 INFO L226 Difference]: Without dead ends: 496 [2019-10-22 08:57:27,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:57:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-10-22 08:57:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 236. [2019-10-22 08:57:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-22 08:57:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2019-10-22 08:57:27,886 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 34 [2019-10-22 08:57:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,887 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-10-22 08:57:27,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2019-10-22 08:57:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 08:57:27,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,889 INFO L380 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] [2019-10-22 08:57:27,889 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1907454321, now seen corresponding path program 1 times [2019-10-22 08:57:27,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080673103] [2019-10-22 08:57:27,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,399 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,400 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:57:28,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:28 BoogieIcfgContainer [2019-10-22 08:57:28,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:28,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:28,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:28,516 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:28,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:25" (3/4) ... [2019-10-22 08:57:28,519 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:57:28,641 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0a9c7cb6-bc19-4402-b8e2-394c4083588f/bin/uautomizer/witness.graphml [2019-10-22 08:57:28,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:28,643 INFO L168 Benchmark]: Toolchain (without parser) took 4173.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.1 MB in the beginning and 872.7 MB in the end (delta: 66.4 MB). Peak memory consumption was 205.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:28,644 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:28,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:28,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:28,644 INFO L168 Benchmark]: Boogie Preprocessor took 30.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:28,645 INFO L168 Benchmark]: RCFGBuilder took 746.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:28,645 INFO L168 Benchmark]: TraceAbstraction took 2684.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.2 MB in the end (delta: 160.2 MB). Peak memory consumption was 160.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:28,645 INFO L168 Benchmark]: Witness Printer took 125.48 ms. Allocated memory is still 1.2 GB. Free memory was 896.2 MB in the beginning and 872.7 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:28,649 INFO L335 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 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 527.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 746.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2684.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.2 MB in the end (delta: 160.2 MB). Peak memory consumption was 160.2 MB. Max. memory is 11.5 GB. * Witness Printer took 125.48 ms. Allocated memory is still 1.2 GB. Free memory was 896.2 MB in the beginning and 872.7 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L218] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L498] int pumpRunning = 0; [L499] int systemActive = 1; [L693] int waterLevel = 1; [L694] int methaneLevelCritical = 0; [L851] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L924] int retValue_acc ; [L925] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] int retValue_acc ; [L845] retValue_acc = 1 [L846] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L931] tmp = valid_product() [L933] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] int splverifierCounter ; [L423] int tmp ; [L424] int tmp___0 ; [L425] int tmp___1 ; [L426] int tmp___2 ; [L429] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L439] tmp = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L711] COND TRUE waterLevel < 2 [L712] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L687] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L506] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L513] COND TRUE \read(systemActive) [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L538] COND TRUE ! pumpRunning [L650] int retValue_acc ; [L651] int tmp ; [L652] int tmp___0 ; [L773] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L776] COND FALSE !(waterLevel < 2) [L780] retValue_acc = 0 [L781] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L656] tmp = isHighWaterSensorDry() [L658] COND FALSE !(\read(tmp)) [L661] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L663] retValue_acc = tmp___0 [L664] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L540] tmp = isHighWaterLevel() [L542] COND TRUE \read(tmp) [L569] int tmp ; [L594] int retValue_acc ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L598] retValue_acc = isMethaneLevelCritical() [L600] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] tmp = isMethaneAlarm() [L575] COND FALSE !(\read(tmp)) [L563] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L788] int tmp ; [L789] int tmp___0 ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L793] tmp = isMethaneLevelCritical() [L795] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L439] tmp = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L723] COND FALSE !(\read(methaneLevelCritical)) [L726] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L687] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L699] COND TRUE waterLevel > 0 [L700] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L513] COND TRUE \read(systemActive) [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L538] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L788] int tmp ; [L789] int tmp___0 ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L793] tmp = isMethaneLevelCritical() [L795] COND TRUE \read(tmp) [L605] int retValue_acc ; [L608] retValue_acc = pumpRunning [L609] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L797] tmp___0 = isPumpRunning() [L799] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L44] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.6s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 821 SDtfs, 1204 SDslu, 1337 SDs, 0 SdLazy, 175 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 902 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 12350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...