./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72d06b83689108b06d89f4f95641f29fdbb51231 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-11-28 17:24:32,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:32,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:32,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:32,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:32,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:32,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:32,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:32,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:32,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:32,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:32,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:32,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:32,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:32,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:32,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:32,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:32,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:32,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:32,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:32,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:32,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:32,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:32,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:32,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:32,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:32,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:32,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:32,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:32,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:32,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:32,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:32,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:32,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:32,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:32,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:32,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:32,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:32,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:32,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:32,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:32,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:24:32,459 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:32,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:32,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:32,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:32,461 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:32,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:32,462 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:32,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:32,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:32,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:32,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:32,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:32,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:32,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:32,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:32,464 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:32,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:32,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:32,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:32,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:32,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:32,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:32,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:32,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:32,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:32,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:32,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:32,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:32,468 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:32,468 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72d06b83689108b06d89f4f95641f29fdbb51231 [2019-11-28 17:24:32,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:32,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:32,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:32,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:32,833 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:32,834 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c [2019-11-28 17:24:32,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a2b4f86/c9ad3939e55e4737aeb97b162b37552e/FLAG9ff334fc7 [2019-11-28 17:24:33,372 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:33,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c [2019-11-28 17:24:33,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a2b4f86/c9ad3939e55e4737aeb97b162b37552e/FLAG9ff334fc7 [2019-11-28 17:24:33,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a2b4f86/c9ad3939e55e4737aeb97b162b37552e [2019-11-28 17:24:33,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:33,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:33,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:33,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:33,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:33,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aed937a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33, skipping insertion in model container [2019-11-28 17:24:33,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:33,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:34,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:34,246 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:34,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:34,386 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:34,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34 WrapperNode [2019-11-28 17:24:34,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:34,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:34,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:34,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:34,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:34,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:34,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:34,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:34,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:34,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:34,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:34,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:34,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:34,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:34,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:35,850 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:35,851 INFO L287 CfgBuilder]: Removed 278 assume(true) statements. [2019-11-28 17:24:35,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:35 BoogieIcfgContainer [2019-11-28 17:24:35,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:35,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:35,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:35,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:35,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:33" (1/3) ... [2019-11-28 17:24:35,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d62a8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:35, skipping insertion in model container [2019-11-28 17:24:35,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34" (2/3) ... [2019-11-28 17:24:35,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d62a8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:35, skipping insertion in model container [2019-11-28 17:24:35,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:35" (3/3) ... [2019-11-28 17:24:35,862 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product54.cil.c [2019-11-28 17:24:35,873 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:35,882 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:35,895 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:35,922 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:35,922 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:35,922 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:35,922 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:35,923 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:35,923 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:35,924 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:35,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2019-11-28 17:24:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:35,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:35,956 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1439730149, now seen corresponding path program 1 times [2019-11-28 17:24:35,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536256242] [2019-11-28 17:24:35,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,261 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-28 17:24:36,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536256242] [2019-11-28 17:24:36,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:36,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215064681] [2019-11-28 17:24:36,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:36,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:36,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:36,290 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 2 states. [2019-11-28 17:24:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:36,382 INFO L93 Difference]: Finished difference Result 372 states and 569 transitions. [2019-11-28 17:24:36,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:36,386 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:36,412 INFO L225 Difference]: With dead ends: 372 [2019-11-28 17:24:36,412 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 17:24:36,421 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-28 17:24:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 17:24:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-11-28 17:24:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-28 17:24:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 276 transitions. [2019-11-28 17:24:36,521 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 276 transitions. Word has length 16 [2019-11-28 17:24:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:36,522 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 276 transitions. [2019-11-28 17:24:36,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2019-11-28 17:24:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:36,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:36,525 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1808480250, now seen corresponding path program 1 times [2019-11-28 17:24:36,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805148761] [2019-11-28 17:24:36,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,659 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-28 17:24:36,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805148761] [2019-11-28 17:24:36,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:36,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480735021] [2019-11-28 17:24:36,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:36,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:36,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:36,663 INFO L87 Difference]: Start difference. First operand 185 states and 276 transitions. Second operand 3 states. [2019-11-28 17:24:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:36,679 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2019-11-28 17:24:36,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:36,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:36,681 INFO L225 Difference]: With dead ends: 185 [2019-11-28 17:24:36,681 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:24:36,683 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-28 17:24:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:24:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 17:24:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 17:24:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2019-11-28 17:24:36,689 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 17 [2019-11-28 17:24:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:36,690 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2019-11-28 17:24:36,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2019-11-28 17:24:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:36,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,692 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-28 17:24:36,692 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,692 INFO L82 PathProgramCache]: Analyzing trace with hash -886510538, now seen corresponding path program 1 times [2019-11-28 17:24:36,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573601073] [2019-11-28 17:24:36,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,790 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-28 17:24:36,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573601073] [2019-11-28 17:24:36,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:36,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675636480] [2019-11-28 17:24:36,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:36,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:36,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:36,793 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand 5 states. [2019-11-28 17:24:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:36,850 INFO L93 Difference]: Finished difference Result 136 states and 204 transitions. [2019-11-28 17:24:36,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:24:36,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 17:24:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:36,852 INFO L225 Difference]: With dead ends: 136 [2019-11-28 17:24:36,852 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:24:36,853 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-28 17:24:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:24:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 17:24:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 17:24:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2019-11-28 17:24:36,861 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 22 [2019-11-28 17:24:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:36,861 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2019-11-28 17:24:36,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2019-11-28 17:24:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:36,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,863 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] [2019-11-28 17:24:36,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1823541737, now seen corresponding path program 1 times [2019-11-28 17:24:36,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224527945] [2019-11-28 17:24:36,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,966 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-28 17:24:36,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224527945] [2019-11-28 17:24:36,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:36,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840252235] [2019-11-28 17:24:36,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:36,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:36,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:36,971 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2019-11-28 17:24:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,028 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2019-11-28 17:24:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:37,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 17:24:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,029 INFO L225 Difference]: With dead ends: 145 [2019-11-28 17:24:37,030 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 17:24:37,030 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-28 17:24:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 17:24:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-28 17:24:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 17:24:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2019-11-28 17:24:37,040 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 25 [2019-11-28 17:24:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,040 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2019-11-28 17:24:37,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2019-11-28 17:24:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:37,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,042 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-28 17:24:37,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash -920121944, now seen corresponding path program 1 times [2019-11-28 17:24:37,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647594931] [2019-11-28 17:24:37,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,124 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-28 17:24:37,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647594931] [2019-11-28 17:24:37,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:37,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169629434] [2019-11-28 17:24:37,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:37,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:37,128 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand 5 states. [2019-11-28 17:24:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,242 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2019-11-28 17:24:37,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:37,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:24:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,244 INFO L225 Difference]: With dead ends: 204 [2019-11-28 17:24:37,244 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 17:24:37,245 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-28 17:24:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 17:24:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2019-11-28 17:24:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 17:24:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2019-11-28 17:24:37,255 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 31 [2019-11-28 17:24:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,255 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2019-11-28 17:24:37,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2019-11-28 17:24:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:37,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,257 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-28 17:24:37,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1742389099, now seen corresponding path program 1 times [2019-11-28 17:24:37,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569091710] [2019-11-28 17:24:37,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,362 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-28 17:24:37,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569091710] [2019-11-28 17:24:37,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:37,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718057089] [2019-11-28 17:24:37,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:37,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:37,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:37,365 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 5 states. [2019-11-28 17:24:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,583 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2019-11-28 17:24:37,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:37,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:24:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,586 INFO L225 Difference]: With dead ends: 250 [2019-11-28 17:24:37,586 INFO L226 Difference]: Without dead ends: 248 [2019-11-28 17:24:37,587 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-28 17:24:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-28 17:24:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 87. [2019-11-28 17:24:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 17:24:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2019-11-28 17:24:37,600 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 31 [2019-11-28 17:24:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,600 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2019-11-28 17:24:37,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2019-11-28 17:24:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:37,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,602 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-28 17:24:37,602 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1313148954, now seen corresponding path program 1 times [2019-11-28 17:24:37,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671202674] [2019-11-28 17:24:37,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,667 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-28 17:24:37,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671202674] [2019-11-28 17:24:37,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:37,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772066796] [2019-11-28 17:24:37,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:24:37,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:24:37,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:24:37,670 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand 4 states. [2019-11-28 17:24:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,752 INFO L93 Difference]: Finished difference Result 204 states and 276 transitions. [2019-11-28 17:24:37,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:24:37,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 17:24:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,753 INFO L225 Difference]: With dead ends: 204 [2019-11-28 17:24:37,753 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 17:24:37,754 INFO L630 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-11-28 17:24:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 17:24:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2019-11-28 17:24:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 17:24:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-28 17:24:37,763 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 31 [2019-11-28 17:24:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,764 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-28 17:24:37,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:24:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-28 17:24:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:37,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,765 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-28 17:24:37,766 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1054983516, now seen corresponding path program 1 times [2019-11-28 17:24:37,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123709036] [2019-11-28 17:24:37,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,804 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-28 17:24:37,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123709036] [2019-11-28 17:24:37,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:37,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929840201] [2019-11-28 17:24:37,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:37,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,807 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-28 17:24:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,852 INFO L93 Difference]: Finished difference Result 207 states and 277 transitions. [2019-11-28 17:24:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:37,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 17:24:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,855 INFO L225 Difference]: With dead ends: 207 [2019-11-28 17:24:37,855 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 17:24:37,856 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-28 17:24:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 17:24:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 17:24:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 17:24:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2019-11-28 17:24:37,869 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 31 [2019-11-28 17:24:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,870 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2019-11-28 17:24:37,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2019-11-28 17:24:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:37,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,874 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, 1] [2019-11-28 17:24:37,874 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1127223910, now seen corresponding path program 1 times [2019-11-28 17:24:37,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434825495] [2019-11-28 17:24:37,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:38,017 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-28 17:24:38,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434825495] [2019-11-28 17:24:38,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:38,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:38,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684652713] [2019-11-28 17:24:38,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:38,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:38,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:38,026 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand 5 states. [2019-11-28 17:24:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,195 INFO L93 Difference]: Finished difference Result 615 states and 812 transitions. [2019-11-28 17:24:38,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:38,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 17:24:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,199 INFO L225 Difference]: With dead ends: 615 [2019-11-28 17:24:38,199 INFO L226 Difference]: Without dead ends: 501 [2019-11-28 17:24:38,200 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-28 17:24:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-28 17:24:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 226. [2019-11-28 17:24:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-28 17:24:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2019-11-28 17:24:38,260 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 32 [2019-11-28 17:24:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,261 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2019-11-28 17:24:38,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2019-11-28 17:24:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:24:38,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,262 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, 1, 1] [2019-11-28 17:24:38,263 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1518924332, now seen corresponding path program 1 times [2019-11-28 17:24:38,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719992048] [2019-11-28 17:24:38,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:38,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:38,416 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:38,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:38 BoogieIcfgContainer [2019-11-28 17:24:38,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:38,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:38,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:38,535 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:38,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:35" (3/4) ... [2019-11-28 17:24:38,539 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:38,628 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:38,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:38,631 INFO L168 Benchmark]: Toolchain (without parser) took 4950.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -194.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:38,631 INFO L168 Benchmark]: CDTParser took 1.09 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:38,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:38,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:38,633 INFO L168 Benchmark]: Boogie Preprocessor took 80.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:38,634 INFO L168 Benchmark]: RCFGBuilder took 1283.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.2 MB). Peak memory consumption was 80.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:38,634 INFO L168 Benchmark]: TraceAbstraction took 2680.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 90.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -152.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:38,635 INFO L168 Benchmark]: Witness Printer took 93.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:38,637 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 707.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1283.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.2 MB). Peak memory consumption was 80.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2680.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 90.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -152.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 93.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 216]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L229] int pumpRunning = 0; [L230] int systemActive = 1; [L691] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L889] int waterLevel = 1; [L890] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L487] int retValue_acc ; [L490] retValue_acc = 1 [L491] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L146] int splverifierCounter ; [L147] int tmp ; [L148] int tmp___0 ; [L149] int tmp___1 ; [L150] int tmp___2 ; [L153] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L163] tmp = __VERIFIER_nondet_int() [L165] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L907] COND TRUE waterLevel < 2 [L908] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L919] COND FALSE !(\read(methaneLevelCritical)) [L922] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) [L456] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L237] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L244] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L321] COND FALSE !(\read(pumpRunning)) [L292] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L295] COND FALSE !(\read(pumpRunning)) [L266] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L269] COND TRUE ! pumpRunning [L415] int retValue_acc ; [L416] int tmp ; [L417] int tmp___0 ; [L969] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L972] COND FALSE !(waterLevel < 2) [L976] retValue_acc = 0 [L977] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L421] tmp = isHighWaterSensorDry() [L423] COND FALSE !(\read(tmp)) [L426] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L428] retValue_acc = tmp___0 [L429] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L271] tmp = isHighWaterLevel() [L273] COND TRUE \read(tmp) [L346] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L497] int tmp ; [L498] int tmp___0 ; [L928] int retValue_acc ; [L931] retValue_acc = methaneLevelCritical [L932] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L502] tmp = isMethaneLevelCritical() [L504] COND TRUE \read(tmp) [L370] int retValue_acc ; [L373] retValue_acc = pumpRunning [L374] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] tmp___0 = isPumpRunning() [L508] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L216] __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, 189 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1137 SDtfs, 1314 SDslu, 1238 SDs, 0 SdLazy, 197 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred 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, 9 MinimizatonAttempts, 513 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 15647 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...