./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/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 3e754f75ca06d39e1069a0bad88498ddd2436bb7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-6b5699a [2019-11-25 08:47:22,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:22,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:22,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:22,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:22,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:22,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:22,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:22,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:22,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:22,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:22,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:22,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:22,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:22,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:22,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:22,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:22,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:22,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:22,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:22,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:22,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:22,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:22,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:22,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:22,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:22,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:22,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:22,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:22,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:22,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:22,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:22,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:22,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:22,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:22,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:22,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:22,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:22,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:22,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:22,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:22,612 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:47:22,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:22,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:22,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:22,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:22,639 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:22,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:22,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:22,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:22,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:22,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:22,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:22,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:22,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:22,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:22,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:22,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:22,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:22,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:22,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:22,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:22,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:22,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:22,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:22,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:22,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:22,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:22,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:22,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:22,643 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/run_dir_1eddae05-884f-4ea7-9164-091402e86787/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 -> 3e754f75ca06d39e1069a0bad88498ddd2436bb7 [2019-11-25 08:47:22,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:22,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:22,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:22,802 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:22,803 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:22,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2019-11-25 08:47:22,853 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/data/7129f6a43/6728390fbb75443392776213ef60a83f/FLAG8151cd1e4 [2019-11-25 08:47:23,277 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:23,278 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2019-11-25 08:47:23,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/data/7129f6a43/6728390fbb75443392776213ef60a83f/FLAG8151cd1e4 [2019-11-25 08:47:23,593 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/data/7129f6a43/6728390fbb75443392776213ef60a83f [2019-11-25 08:47:23,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:23,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:23,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:23,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:23,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:23,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:23" (1/1) ... [2019-11-25 08:47:23,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1335521e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:23, skipping insertion in model container [2019-11-25 08:47:23,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:23" (1/1) ... [2019-11-25 08:47:23,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:23,666 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:23,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:23,994 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:24,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:24,122 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:24,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24 WrapperNode [2019-11-25 08:47:24,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:24,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:24,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:24,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:24,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:24,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:24,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:24,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:24,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... [2019-11-25 08:47:24,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:24,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:24,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:24,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:24,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/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-11-25 08:47:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:47:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-25 08:47:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:24,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:24,947 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:24,948 INFO L284 CfgBuilder]: Removed 96 assume(true) statements. [2019-11-25 08:47:24,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:24 BoogieIcfgContainer [2019-11-25 08:47:24,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:24,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:24,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:24,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:24,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:23" (1/3) ... [2019-11-25 08:47:24,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba3301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:24, skipping insertion in model container [2019-11-25 08:47:24,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:24" (2/3) ... [2019-11-25 08:47:24,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba3301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:24, skipping insertion in model container [2019-11-25 08:47:24,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:24" (3/3) ... [2019-11-25 08:47:24,956 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product33.cil.c [2019-11-25 08:47:24,964 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:24,971 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-25 08:47:24,980 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-25 08:47:25,007 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:25,007 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:25,007 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:25,008 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:25,008 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:25,008 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:25,008 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:25,008 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-25 08:47:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:47:25,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:25,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:25,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash 768274677, now seen corresponding path program 1 times [2019-11-25 08:47:25,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626532267] [2019-11-25 08:47:25,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:25,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626532267] [2019-11-25 08:47:25,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:25,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:25,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016599395] [2019-11-25 08:47:25,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:47:25,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:25,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:47:25,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:47:25,282 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-25 08:47:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:25,304 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-11-25 08:47:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:47:25,305 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-25 08:47:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:25,315 INFO L225 Difference]: With dead ends: 150 [2019-11-25 08:47:25,315 INFO L226 Difference]: Without dead ends: 74 [2019-11-25 08:47:25,318 INFO L630 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-11-25 08:47:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-25 08:47:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-25 08:47:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:47:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-11-25 08:47:25,356 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-11-25 08:47:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:25,357 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-11-25 08:47:25,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:47:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-11-25 08:47:25,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:47:25,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:25,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:25,358 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1484097871, now seen corresponding path program 1 times [2019-11-25 08:47:25,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076838272] [2019-11-25 08:47:25,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:25,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076838272] [2019-11-25 08:47:25,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:25,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:25,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559992956] [2019-11-25 08:47:25,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:25,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:25,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:25,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:25,492 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-11-25 08:47:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:25,506 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-11-25 08:47:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:25,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-25 08:47:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:25,509 INFO L225 Difference]: With dead ends: 74 [2019-11-25 08:47:25,510 INFO L226 Difference]: Without dead ends: 34 [2019-11-25 08:47:25,511 INFO L630 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-11-25 08:47:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-25 08:47:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-25 08:47:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 08:47:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-11-25 08:47:25,521 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-11-25 08:47:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:25,522 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-25 08:47:25,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-11-25 08:47:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:47:25,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:25,523 INFO L410 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-11-25 08:47:25,523 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:25,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,524 INFO L82 PathProgramCache]: Analyzing trace with hash 670124178, now seen corresponding path program 1 times [2019-11-25 08:47:25,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706922190] [2019-11-25 08:47:25,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:25,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706922190] [2019-11-25 08:47:25,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:25,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:25,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744779743] [2019-11-25 08:47:25,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:25,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:25,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:25,610 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. [2019-11-25 08:47:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:25,616 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-11-25 08:47:25,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:25,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 08:47:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:25,618 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:47:25,618 INFO L226 Difference]: Without dead ends: 34 [2019-11-25 08:47:25,619 INFO L630 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-11-25 08:47:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-25 08:47:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-25 08:47:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 08:47:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-11-25 08:47:25,623 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-11-25 08:47:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:25,624 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-25 08:47:25,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-11-25 08:47:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:47:25,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:25,625 INFO L410 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-11-25 08:47:25,625 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1804645939, now seen corresponding path program 1 times [2019-11-25 08:47:25,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534091610] [2019-11-25 08:47:25,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:25,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534091610] [2019-11-25 08:47:25,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:25,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:25,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720079550] [2019-11-25 08:47:25,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:25,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:25,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:25,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:25,688 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-11-25 08:47:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:25,710 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-11-25 08:47:25,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:25,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:47:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:25,712 INFO L225 Difference]: With dead ends: 83 [2019-11-25 08:47:25,712 INFO L226 Difference]: Without dead ends: 55 [2019-11-25 08:47:25,713 INFO L630 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-11-25 08:47:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-25 08:47:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-25 08:47:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 08:47:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-11-25 08:47:25,722 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-11-25 08:47:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:25,723 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-11-25 08:47:25,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-11-25 08:47:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:47:25,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:25,724 INFO L410 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] [2019-11-25 08:47:25,725 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1746371458, now seen corresponding path program 1 times [2019-11-25 08:47:25,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955202076] [2019-11-25 08:47:25,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:25,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955202076] [2019-11-25 08:47:25,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:25,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:25,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327465891] [2019-11-25 08:47:25,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:25,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:25,796 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-11-25 08:47:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:25,886 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-11-25 08:47:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:25,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-25 08:47:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:25,892 INFO L225 Difference]: With dead ends: 139 [2019-11-25 08:47:25,892 INFO L226 Difference]: Without dead ends: 92 [2019-11-25 08:47:25,893 INFO L630 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-11-25 08:47:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-25 08:47:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-11-25 08:47:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 08:47:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-11-25 08:47:25,908 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-11-25 08:47:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:25,909 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-11-25 08:47:25,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-11-25 08:47:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:47:25,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:25,910 INFO L410 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] [2019-11-25 08:47:25,910 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:25,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,911 INFO L82 PathProgramCache]: Analyzing trace with hash 916139585, now seen corresponding path program 1 times [2019-11-25 08:47:25,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155122124] [2019-11-25 08:47:25,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:26,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155122124] [2019-11-25 08:47:26,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:26,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:26,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025916789] [2019-11-25 08:47:26,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:26,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:26,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:26,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:26,024 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2019-11-25 08:47:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:26,119 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-11-25 08:47:26,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:47:26,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-25 08:47:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:26,124 INFO L225 Difference]: With dead ends: 270 [2019-11-25 08:47:26,124 INFO L226 Difference]: Without dead ends: 220 [2019-11-25 08:47:26,125 INFO L630 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-11-25 08:47:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-25 08:47:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 100. [2019-11-25 08:47:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-25 08:47:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2019-11-25 08:47:26,155 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 29 [2019-11-25 08:47:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:26,156 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2019-11-25 08:47:26,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2019-11-25 08:47:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:47:26,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:26,163 INFO L410 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] [2019-11-25 08:47:26,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash -863305781, now seen corresponding path program 1 times [2019-11-25 08:47:26,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98698750] [2019-11-25 08:47:26,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:26,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98698750] [2019-11-25 08:47:26,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:26,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:26,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255074114] [2019-11-25 08:47:26,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:26,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:26,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:26,245 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 5 states. [2019-11-25 08:47:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:26,375 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2019-11-25 08:47:26,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:47:26,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-25 08:47:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:26,378 INFO L225 Difference]: With dead ends: 280 [2019-11-25 08:47:26,378 INFO L226 Difference]: Without dead ends: 278 [2019-11-25 08:47:26,379 INFO L630 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-11-25 08:47:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-25 08:47:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-11-25 08:47:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-25 08:47:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2019-11-25 08:47:26,408 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 30 [2019-11-25 08:47:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:26,409 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2019-11-25 08:47:26,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2019-11-25 08:47:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:47:26,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:26,412 INFO L410 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] [2019-11-25 08:47:26,412 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash 376123462, now seen corresponding path program 1 times [2019-11-25 08:47:26,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290360252] [2019-11-25 08:47:26,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:26,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290360252] [2019-11-25 08:47:26,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:26,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:26,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017675534] [2019-11-25 08:47:26,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:26,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:26,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:26,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:26,473 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 5 states. [2019-11-25 08:47:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:26,542 INFO L93 Difference]: Finished difference Result 276 states and 374 transitions. [2019-11-25 08:47:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:26,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-25 08:47:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:26,544 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:47:26,544 INFO L226 Difference]: Without dead ends: 182 [2019-11-25 08:47:26,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-11-25 08:47:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-25 08:47:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 104. [2019-11-25 08:47:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-25 08:47:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2019-11-25 08:47:26,557 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 30 [2019-11-25 08:47:26,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:26,558 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2019-11-25 08:47:26,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2019-11-25 08:47:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:47:26,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:26,559 INFO L410 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] [2019-11-25 08:47:26,560 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash 634288900, now seen corresponding path program 1 times [2019-11-25 08:47:26,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761092792] [2019-11-25 08:47:26,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:26,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761092792] [2019-11-25 08:47:26,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:26,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:26,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030212453] [2019-11-25 08:47:26,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:26,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:26,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:26,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:26,613 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand 3 states. [2019-11-25 08:47:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:26,641 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2019-11-25 08:47:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:26,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-25 08:47:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:26,643 INFO L225 Difference]: With dead ends: 250 [2019-11-25 08:47:26,643 INFO L226 Difference]: Without dead ends: 152 [2019-11-25 08:47:26,644 INFO L630 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-11-25 08:47:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-25 08:47:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-25 08:47:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 08:47:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2019-11-25 08:47:26,660 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2019-11-25 08:47:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:26,660 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2019-11-25 08:47:26,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2019-11-25 08:47:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:47:26,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:26,662 INFO L410 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] [2019-11-25 08:47:26,662 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1373527294, now seen corresponding path program 1 times [2019-11-25 08:47:26,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274060266] [2019-11-25 08:47:26,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:26,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:26,795 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:47:26,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:26 BoogieIcfgContainer [2019-11-25 08:47:26,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:26,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:26,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:26,881 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:26,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:24" (3/4) ... [2019-11-25 08:47:26,892 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:47:27,046 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1eddae05-884f-4ea7-9164-091402e86787/bin/uautomizer/witness.graphml [2019-11-25 08:47:27,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:27,051 INFO L168 Benchmark]: Toolchain (without parser) took 3453.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 939.3 MB in the beginning and 852.6 MB in the end (delta: 86.8 MB). Peak memory consumption was 241.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:27,052 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:27,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:27,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:27,056 INFO L168 Benchmark]: Boogie Preprocessor took 34.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:27,056 INFO L168 Benchmark]: RCFGBuilder took 726.00 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: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:27,057 INFO L168 Benchmark]: TraceAbstraction took 1930.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 866.1 MB in the end (delta: 202.7 MB). Peak memory consumption was 202.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:27,057 INFO L168 Benchmark]: Witness Printer took 166.95 ms. Allocated memory is still 1.2 GB. Free memory was 866.1 MB in the beginning and 852.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:27,061 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 526.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 726.00 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: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1930.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 866.1 MB in the end (delta: 202.7 MB). Peak memory consumption was 202.7 MB. Max. memory is 11.5 GB. * Witness Printer took 166.95 ms. Allocated memory is still 1.2 GB. Free memory was 866.1 MB in the beginning and 852.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 410]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L424] int pumpRunning = 0; [L425] int systemActive = 1; [L683] int cleanupTimeShifts = 4; [L806] int waterLevel = 1; [L807] int methaneLevelCritical = 0; [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L756] int retValue_acc ; [L757] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L674] int retValue_acc ; [L677] retValue_acc = 1 [L678] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L763] tmp = valid_product() [L765] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L581] int splverifierCounter ; [L582] int tmp ; [L583] int tmp___0 ; [L584] int tmp___1 ; [L585] int tmp___2 ; [L588] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L590] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L592] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L598] tmp = __VERIFIER_nondet_int() [L600] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] COND TRUE waterLevel < 2 [L825] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] tmp___0 = __VERIFIER_nondet_int() [L610] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L836] COND FALSE !(\read(methaneLevelCritical)) [L839] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L618] tmp___2 = __VERIFIER_nondet_int() [L620] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] COND TRUE \read(systemActive) [L461] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L464] COND TRUE ! pumpRunning [L558] int retValue_acc ; [L559] int tmp ; [L560] int tmp___0 ; [L886] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L889] COND FALSE !(waterLevel < 2) [L893] retValue_acc = 0 [L894] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L564] tmp = isHighWaterSensorDry() [L566] COND FALSE !(\read(tmp)) [L569] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L571] retValue_acc = tmp___0 [L572] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] tmp = isHighWaterLevel() [L468] COND TRUE \read(tmp) [L489] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L780] int tmp ; [L781] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = methaneLevelCritical [L849] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L785] tmp = isMethaneLevelCritical() [L787] COND TRUE \read(tmp) [L513] int retValue_acc ; [L516] retValue_acc = pumpRunning [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L789] tmp___0 = isPumpRunning() [L791] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L410] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 3 error locations. Result: UNSAFE, OverallTime: 1.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 577 SDtfs, 704 SDslu, 767 SDs, 0 SdLazy, 102 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 414 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 12233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...