./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product55.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_product55.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 f98010979adc33ea49508c52e1057d4173359b78 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:33,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:33,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:33,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:33,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:33,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:33,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:33,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:33,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:33,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:33,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:33,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:33,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:33,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:33,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:33,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:33,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:33,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:33,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:33,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:33,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:33,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:33,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:33,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:33,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:33,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:33,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:33,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:33,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:33,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:33,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:33,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:33,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:33,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:33,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:33,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:33,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:33,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:33,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:33,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:33,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:33,228 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:33,247 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:33,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:33,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:33,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:33,249 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:33,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:33,249 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:33,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:33,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:33,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:33,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:33,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:33,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:33,251 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:33,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:33,251 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:33,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:33,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:33,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:33,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:33,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:33,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:33,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:33,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:33,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:33,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:33,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:33,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:33,254 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:33,254 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 -> f98010979adc33ea49508c52e1057d4173359b78 [2019-11-28 17:24:33,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:33,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:33,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:33,596 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:33,597 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:33,597 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c [2019-11-28 17:24:33,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e389153/e7d67089d962441a9003f32ebbf154e4/FLAG8a9375fe7 [2019-11-28 17:24:34,190 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:34,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c [2019-11-28 17:24:34,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e389153/e7d67089d962441a9003f32ebbf154e4/FLAG8a9375fe7 [2019-11-28 17:24:34,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e389153/e7d67089d962441a9003f32ebbf154e4 [2019-11-28 17:24:34,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:34,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:34,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:34,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:34,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:34,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db1edcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34, skipping insertion in model container [2019-11-28 17:24:34,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:34,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:35,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:35,128 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:35,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:35,260 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:35,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35 WrapperNode [2019-11-28 17:24:35,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:35,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:35,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:35,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:35,271 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:35" (1/1) ... [2019-11-28 17:24:35,291 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:35" (1/1) ... [2019-11-28 17:24:35,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:35,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:35,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:35,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:35,361 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:35" (1/1) ... [2019-11-28 17:24:35,361 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:35" (1/1) ... [2019-11-28 17:24:35,369 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:35" (1/1) ... [2019-11-28 17:24:35,369 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:35" (1/1) ... [2019-11-28 17:24:35,388 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:35" (1/1) ... [2019-11-28 17:24:35,402 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:35" (1/1) ... [2019-11-28 17:24:35,416 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:35" (1/1) ... [2019-11-28 17:24:35,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:35,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:35,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:35,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:35,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (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:35,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:36,677 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:36,678 INFO L287 CfgBuilder]: Removed 280 assume(true) statements. [2019-11-28 17:24:36,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:36 BoogieIcfgContainer [2019-11-28 17:24:36,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:36,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:36,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:36,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:36,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:34" (1/3) ... [2019-11-28 17:24:36,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d435756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:36, skipping insertion in model container [2019-11-28 17:24:36,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (2/3) ... [2019-11-28 17:24:36,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d435756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:36, skipping insertion in model container [2019-11-28 17:24:36,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:36" (3/3) ... [2019-11-28 17:24:36,689 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product55.cil.c [2019-11-28 17:24:36,700 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:36,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:36,722 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:36,746 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:36,746 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:36,746 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:36,747 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:36,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:36,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:36,747 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:36,748 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-11-28 17:24:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:36,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,780 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:36,781 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1084846627, now seen corresponding path program 1 times [2019-11-28 17:24:36,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477623783] [2019-11-28 17:24:36,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,063 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,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477623783] [2019-11-28 17:24:37,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:37,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171709029] [2019-11-28 17:24:37,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:37,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:37,096 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2019-11-28 17:24:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,151 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2019-11-28 17:24:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:37,153 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,171 INFO L225 Difference]: With dead ends: 376 [2019-11-28 17:24:37,172 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 17:24:37,178 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:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 17:24:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-11-28 17:24:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-28 17:24:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2019-11-28 17:24:37,244 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2019-11-28 17:24:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,246 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2019-11-28 17:24:37,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2019-11-28 17:24:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:37,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,248 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:37,249 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash 38089730, now seen corresponding path program 1 times [2019-11-28 17:24:37,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070744133] [2019-11-28 17:24:37,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,400 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,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070744133] [2019-11-28 17:24:37,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:37,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084467175] [2019-11-28 17:24:37,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:37,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,405 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2019-11-28 17:24:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,422 INFO L93 Difference]: Finished difference Result 187 states and 279 transitions. [2019-11-28 17:24:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:37,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,425 INFO L225 Difference]: With dead ends: 187 [2019-11-28 17:24:37,425 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 17:24:37,427 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:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 17:24:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 17:24:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 17:24:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2019-11-28 17:24:37,436 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2019-11-28 17:24:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,437 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2019-11-28 17:24:37,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2019-11-28 17:24:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:37,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,439 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:37,439 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1082167242, now seen corresponding path program 1 times [2019-11-28 17:24:37,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466721611] [2019-11-28 17:24:37,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,571 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,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466721611] [2019-11-28 17:24:37,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:37,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802772588] [2019-11-28 17:24:37,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:24:37,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:24:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:24:37,578 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 6 states. [2019-11-28 17:24:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,723 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2019-11-28 17:24:37,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:37,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 17:24:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,727 INFO L225 Difference]: With dead ends: 230 [2019-11-28 17:24:37,728 INFO L226 Difference]: Without dead ends: 163 [2019-11-28 17:24:37,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:24:37,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-28 17:24:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 92. [2019-11-28 17:24:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 17:24:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2019-11-28 17:24:37,758 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 22 [2019-11-28 17:24:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,766 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-11-28 17:24:37,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:24:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2019-11-28 17:24:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:37,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,770 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:37,770 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1933185311, now seen corresponding path program 1 times [2019-11-28 17:24:37,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225883177] [2019-11-28 17:24:37,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,838 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,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225883177] [2019-11-28 17:24:37,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:37,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916737199] [2019-11-28 17:24:37,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:37,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,843 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand 3 states. [2019-11-28 17:24:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,900 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2019-11-28 17:24:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:37,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 17:24:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,902 INFO L225 Difference]: With dead ends: 187 [2019-11-28 17:24:37,903 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 17:24:37,904 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,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 17:24:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-28 17:24:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 17:24:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2019-11-28 17:24:37,917 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 25 [2019-11-28 17:24:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,918 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2019-11-28 17:24:37,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2019-11-28 17:24:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:37,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,920 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:37,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2034893835, now seen corresponding path program 1 times [2019-11-28 17:24:37,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890820366] [2019-11-28 17:24:37,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,998 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,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890820366] [2019-11-28 17:24:37,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:38,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924443717] [2019-11-28 17:24:38,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:38,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:38,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:38,002 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand 5 states. [2019-11-28 17:24:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,216 INFO L93 Difference]: Finished difference Result 281 states and 403 transitions. [2019-11-28 17:24:38,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:38,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 17:24:38,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,219 INFO L225 Difference]: With dead ends: 281 [2019-11-28 17:24:38,219 INFO L226 Difference]: Without dead ends: 279 [2019-11-28 17:24:38,220 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,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-28 17:24:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 99. [2019-11-28 17:24:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 17:24:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2019-11-28 17:24:38,235 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 25 [2019-11-28 17:24:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,236 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2019-11-28 17:24:38,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2019-11-28 17:24:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:38,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,238 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:38,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash -899676752, now seen corresponding path program 1 times [2019-11-28 17:24:38,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083492750] [2019-11-28 17:24:38,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:38,295 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,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083492750] [2019-11-28 17:24:38,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:38,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:38,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468821204] [2019-11-28 17:24:38,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:38,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:38,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:38,298 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand 5 states. [2019-11-28 17:24:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,401 INFO L93 Difference]: Finished difference Result 282 states and 395 transitions. [2019-11-28 17:24:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:38,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:24:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,403 INFO L225 Difference]: With dead ends: 282 [2019-11-28 17:24:38,403 INFO L226 Difference]: Without dead ends: 189 [2019-11-28 17:24:38,404 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:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-28 17:24:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 108. [2019-11-28 17:24:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 17:24:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2019-11-28 17:24:38,417 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 31 [2019-11-28 17:24:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,418 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2019-11-28 17:24:38,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2019-11-28 17:24:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:38,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,420 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:38,420 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1292703762, now seen corresponding path program 1 times [2019-11-28 17:24:38,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70982360] [2019-11-28 17:24:38,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:38,476 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,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70982360] [2019-11-28 17:24:38,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:38,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:38,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976738192] [2019-11-28 17:24:38,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:24:38,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:24:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:24:38,478 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand 4 states. [2019-11-28 17:24:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,542 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2019-11-28 17:24:38,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:24:38,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 17:24:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,544 INFO L225 Difference]: With dead ends: 266 [2019-11-28 17:24:38,544 INFO L226 Difference]: Without dead ends: 164 [2019-11-28 17:24:38,547 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:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-28 17:24:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2019-11-28 17:24:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 17:24:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2019-11-28 17:24:38,563 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 31 [2019-11-28 17:24:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,563 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2019-11-28 17:24:38,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:24:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2019-11-28 17:24:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:38,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,567 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:38,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1034538324, now seen corresponding path program 1 times [2019-11-28 17:24:38,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917034694] [2019-11-28 17:24:38,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:38,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:38,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917034694] [2019-11-28 17:24:38,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:38,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:38,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066895438] [2019-11-28 17:24:38,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:38,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:38,663 INFO L87 Difference]: Start difference. First operand 114 states and 154 transitions. Second operand 3 states. [2019-11-28 17:24:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,709 INFO L93 Difference]: Finished difference Result 269 states and 365 transitions. [2019-11-28 17:24:38,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:38,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 17:24:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,711 INFO L225 Difference]: With dead ends: 269 [2019-11-28 17:24:38,711 INFO L226 Difference]: Without dead ends: 161 [2019-11-28 17:24:38,712 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:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-28 17:24:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-28 17:24:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-28 17:24:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2019-11-28 17:24:38,730 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 31 [2019-11-28 17:24:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,731 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2019-11-28 17:24:38,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2019-11-28 17:24:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:38,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,733 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:38,733 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1147669102, now seen corresponding path program 1 times [2019-11-28 17:24:38,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383156039] [2019-11-28 17:24:38,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:38,877 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,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383156039] [2019-11-28 17:24:38,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:38,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:38,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368742862] [2019-11-28 17:24:38,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:38,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:38,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:38,885 INFO L87 Difference]: Start difference. First operand 161 states and 214 transitions. Second operand 5 states. [2019-11-28 17:24:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:39,054 INFO L93 Difference]: Finished difference Result 818 states and 1098 transitions. [2019-11-28 17:24:39,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:39,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 17:24:39,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:39,059 INFO L225 Difference]: With dead ends: 818 [2019-11-28 17:24:39,059 INFO L226 Difference]: Without dead ends: 663 [2019-11-28 17:24:39,060 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:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-28 17:24:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 304. [2019-11-28 17:24:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-28 17:24:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 400 transitions. [2019-11-28 17:24:39,097 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 400 transitions. Word has length 32 [2019-11-28 17:24:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:39,098 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 400 transitions. [2019-11-28 17:24:39,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 400 transitions. [2019-11-28 17:24:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:24:39,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:39,099 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:39,100 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1539369524, now seen corresponding path program 1 times [2019-11-28 17:24:39,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:39,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143047094] [2019-11-28 17:24:39,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:39,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:39,236 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:39,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:39 BoogieIcfgContainer [2019-11-28 17:24:39,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:39,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:39,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:39,381 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:39,382 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:36" (3/4) ... [2019-11-28 17:24:39,391 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:39,557 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:39,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:39,563 INFO L168 Benchmark]: Toolchain (without parser) took 5024.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,564 INFO L168 Benchmark]: CDTParser took 0.19 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:39,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.95 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,568 INFO L168 Benchmark]: Boogie Preprocessor took 83.48 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,568 INFO L168 Benchmark]: RCFGBuilder took 1243.87 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: 76.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,570 INFO L168 Benchmark]: TraceAbstraction took 2699.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -88.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:39,571 INFO L168 Benchmark]: Witness Printer took 176.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,575 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.19 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 725.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.95 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.48 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1243.87 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: 76.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2699.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -88.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 176.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 506]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L159] int pumpRunning = 0; [L160] int systemActive = 1; [L399] int waterLevel = 1; [L400] int methaneLevelCritical = 0; [L511] int cleanupTimeShifts = 4; [L802] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L584] int retValue_acc ; [L585] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L591] tmp = valid_product() [L593] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L84] int splverifierCounter ; [L85] int tmp ; [L86] int tmp___0 ; [L87] int tmp___1 ; [L88] int tmp___2 ; [L91] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L93] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L95] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L101] tmp = __VERIFIER_nondet_int() [L103] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] COND TRUE waterLevel < 2 [L418] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L111] tmp___0 = __VERIFIER_nondet_int() [L113] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L429] COND FALSE !(\read(methaneLevelCritical)) [L432] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L121] tmp___2 = __VERIFIER_nondet_int() [L123] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L167] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L174] COND TRUE \read(systemActive) [L248] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L251] COND FALSE !(\read(pumpRunning)) [L222] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L225] COND FALSE !(\read(pumpRunning)) [L196] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L199] COND TRUE ! pumpRunning [L345] int retValue_acc ; [L346] int tmp ; [L347] int tmp___0 ; [L479] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L482] COND FALSE !(waterLevel < 2) [L486] retValue_acc = 0 [L487] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L351] tmp = isHighWaterSensorDry() [L353] COND FALSE !(\read(tmp)) [L356] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L358] retValue_acc = tmp___0 [L359] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L201] tmp = isHighWaterLevel() [L203] COND TRUE \read(tmp) [L276] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L608] int tmp ; [L609] int tmp___0 ; [L438] int retValue_acc ; [L441] retValue_acc = methaneLevelCritical [L442] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L613] tmp = isMethaneLevelCritical() [L615] COND TRUE \read(tmp) [L300] int retValue_acc ; [L303] retValue_acc = pumpRunning [L304] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L617] tmp___0 = isPumpRunning() [L619] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] __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, 191 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1183 SDtfs, 1480 SDslu, 1720 SDs, 0 SdLazy, 217 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred 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, 743 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 15338 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...