./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product50.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_product50.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 63231100df91d767f63e82b83b0d6c2eaec3a983 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:30,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:30,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:30,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:30,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:30,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:30,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:30,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:30,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:30,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:30,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:30,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:30,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:30,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:30,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:30,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:30,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:30,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:30,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:30,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:30,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:30,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:30,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:30,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:30,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:30,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:30,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:30,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:30,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:30,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:30,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:30,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:30,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:30,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:30,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:30,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:30,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:30,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:30,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:30,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:30,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:30,311 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:30,325 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:30,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:30,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:30,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:30,327 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:30,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:30,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:30,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:30,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:30,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:30,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:30,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:30,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:30,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:30,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:30,330 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:30,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:30,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:30,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:30,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:30,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:30,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:30,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:30,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:30,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:30,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:30,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:30,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:30,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:30,333 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 -> 63231100df91d767f63e82b83b0d6c2eaec3a983 [2019-11-28 17:24:30,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:30,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:30,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:30,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:30,661 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:30,662 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2019-11-28 17:24:30,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e27731af/bd2867a47f0c4882a5669b4035282bcc/FLAGed8ebdde6 [2019-11-28 17:24:31,336 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:31,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2019-11-28 17:24:31,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e27731af/bd2867a47f0c4882a5669b4035282bcc/FLAGed8ebdde6 [2019-11-28 17:24:31,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e27731af/bd2867a47f0c4882a5669b4035282bcc [2019-11-28 17:24:31,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:31,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:31,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:31,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:31,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:31,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:31" (1/1) ... [2019-11-28 17:24:31,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e036dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:31, skipping insertion in model container [2019-11-28 17:24:31,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:31" (1/1) ... [2019-11-28 17:24:31,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:31,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:32,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:32,122 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:32,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:32,273 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:32,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:32 WrapperNode [2019-11-28 17:24:32,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:32,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:32,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:32,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:32,284 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:32" (1/1) ... [2019-11-28 17:24:32,305 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:32" (1/1) ... [2019-11-28 17:24:32,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:32,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:32,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:32,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:32,370 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:32" (1/1) ... [2019-11-28 17:24:32,370 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:32" (1/1) ... [2019-11-28 17:24:32,375 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:32" (1/1) ... [2019-11-28 17:24:32,376 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:32" (1/1) ... [2019-11-28 17:24:32,390 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:32" (1/1) ... [2019-11-28 17:24:32,399 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:32" (1/1) ... [2019-11-28 17:24:32,402 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:32" (1/1) ... [2019-11-28 17:24:32,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:32,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:32,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:32,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:32,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:32" (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:32,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:32,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:33,424 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:33,424 INFO L287 CfgBuilder]: Removed 158 assume(true) statements. [2019-11-28 17:24:33,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:33 BoogieIcfgContainer [2019-11-28 17:24:33,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:33,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:33,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:33,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:33,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:31" (1/3) ... [2019-11-28 17:24:33,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42842c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:33, skipping insertion in model container [2019-11-28 17:24:33,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:32" (2/3) ... [2019-11-28 17:24:33,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42842c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:33, skipping insertion in model container [2019-11-28 17:24:33,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:33" (3/3) ... [2019-11-28 17:24:33,436 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product50.cil.c [2019-11-28 17:24:33,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:33,461 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:33,472 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:33,496 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:33,496 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:33,496 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:33,496 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:33,497 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:33,497 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:33,497 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:33,497 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-11-28 17:24:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:33,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:33,527 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:33,527 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1800894747, now seen corresponding path program 1 times [2019-11-28 17:24:33,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:33,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321173299] [2019-11-28 17:24:33,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:33,828 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:33,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321173299] [2019-11-28 17:24:33,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:33,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:33,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845601840] [2019-11-28 17:24:33,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:33,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:33,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:33,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:33,863 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2019-11-28 17:24:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:33,910 INFO L93 Difference]: Finished difference Result 228 states and 347 transitions. [2019-11-28 17:24:33,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:33,913 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:33,933 INFO L225 Difference]: With dead ends: 228 [2019-11-28 17:24:33,933 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 17:24:33,938 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:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 17:24:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 17:24:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 17:24:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-11-28 17:24:34,001 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 16 [2019-11-28 17:24:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,002 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-11-28 17:24:34,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-11-28 17:24:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:34,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,007 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:34,008 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1447315652, now seen corresponding path program 1 times [2019-11-28 17:24:34,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430591514] [2019-11-28 17:24:34,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,185 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:34,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430591514] [2019-11-28 17:24:34,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:34,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23825436] [2019-11-28 17:24:34,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:34,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:34,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:34,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:34,192 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 3 states. [2019-11-28 17:24:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:34,215 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2019-11-28 17:24:34,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:34,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:34,220 INFO L225 Difference]: With dead ends: 113 [2019-11-28 17:24:34,220 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:24:34,221 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:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:24:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:24:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:24:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 17:24:34,233 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 17:24:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,235 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 17:24:34,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 17:24:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:34,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,236 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:34,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash -230586389, now seen corresponding path program 1 times [2019-11-28 17:24:34,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551072855] [2019-11-28 17:24:34,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,371 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:34,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551072855] [2019-11-28 17:24:34,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:34,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675030812] [2019-11-28 17:24:34,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:34,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:34,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:34,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:34,378 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2019-11-28 17:24:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:34,469 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-11-28 17:24:34,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:24:34,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 17:24:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:34,474 INFO L225 Difference]: With dead ends: 88 [2019-11-28 17:24:34,474 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:24:34,475 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:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:24:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:24:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:24:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-11-28 17:24:34,488 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 22 [2019-11-28 17:24:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,489 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-11-28 17:24:34,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-11-28 17:24:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:24:34,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,491 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] [2019-11-28 17:24:34,495 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash -108421843, now seen corresponding path program 1 times [2019-11-28 17:24:34,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085931598] [2019-11-28 17:24:34,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,596 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:34,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085931598] [2019-11-28 17:24:34,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:34,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523631236] [2019-11-28 17:24:34,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:34,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:34,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:34,600 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2019-11-28 17:24:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:34,665 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2019-11-28 17:24:34,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:34,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:24:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:34,668 INFO L225 Difference]: With dead ends: 109 [2019-11-28 17:24:34,668 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:24:34,669 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:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:24:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 17:24:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:24:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-11-28 17:24:34,683 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 24 [2019-11-28 17:24:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,683 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-11-28 17:24:34,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-11-28 17:24:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:34,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:34,685 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1619186466, now seen corresponding path program 1 times [2019-11-28 17:24:34,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871568245] [2019-11-28 17:24:34,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,754 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:34,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871568245] [2019-11-28 17:24:34,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:34,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035781003] [2019-11-28 17:24:34,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:34,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:34,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:34,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:34,757 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 5 states. [2019-11-28 17:24:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:34,958 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2019-11-28 17:24:34,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:34,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:34,961 INFO L225 Difference]: With dead ends: 175 [2019-11-28 17:24:34,961 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 17:24:34,962 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:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 17:24:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-11-28 17:24:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 17:24:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-11-28 17:24:34,972 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 30 [2019-11-28 17:24:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,973 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-11-28 17:24:34,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-11-28 17:24:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:34,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:34,975 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1043324577, now seen corresponding path program 1 times [2019-11-28 17:24:34,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805564768] [2019-11-28 17:24:34,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,049 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:35,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805564768] [2019-11-28 17:24:35,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:35,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607622423] [2019-11-28 17:24:35,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:35,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:35,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:35,053 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 5 states. [2019-11-28 17:24:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,205 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2019-11-28 17:24:35,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:35,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,209 INFO L225 Difference]: With dead ends: 204 [2019-11-28 17:24:35,210 INFO L226 Difference]: Without dead ends: 202 [2019-11-28 17:24:35,210 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:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-28 17:24:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 72. [2019-11-28 17:24:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 17:24:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2019-11-28 17:24:35,223 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 30 [2019-11-28 17:24:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,223 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2019-11-28 17:24:35,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2019-11-28 17:24:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:35,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:35,225 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2012213476, now seen corresponding path program 1 times [2019-11-28 17:24:35,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431213632] [2019-11-28 17:24:35,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,287 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:35,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431213632] [2019-11-28 17:24:35,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:35,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64636653] [2019-11-28 17:24:35,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:24:35,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:24:35,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:24:35,290 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 4 states. [2019-11-28 17:24:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,348 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2019-11-28 17:24:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:24:35,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 17:24:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,350 INFO L225 Difference]: With dead ends: 168 [2019-11-28 17:24:35,350 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 17:24:35,352 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:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 17:24:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2019-11-28 17:24:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 17:24:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2019-11-28 17:24:35,363 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 30 [2019-11-28 17:24:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,364 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2019-11-28 17:24:35,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:24:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2019-11-28 17:24:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:35,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:35,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1754048038, now seen corresponding path program 1 times [2019-11-28 17:24:35,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819785369] [2019-11-28 17:24:35,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,411 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:35,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819785369] [2019-11-28 17:24:35,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:35,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489843652] [2019-11-28 17:24:35,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:35,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:35,413 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2019-11-28 17:24:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,440 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-11-28 17:24:35,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:35,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 17:24:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,442 INFO L225 Difference]: With dead ends: 172 [2019-11-28 17:24:35,442 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 17:24:35,442 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:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 17:24:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-28 17:24:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 17:24:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-11-28 17:24:35,454 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 30 [2019-11-28 17:24:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,455 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-11-28 17:24:35,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2019-11-28 17:24:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:35,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,456 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:35,457 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,457 INFO L82 PathProgramCache]: Analyzing trace with hash 533103064, now seen corresponding path program 1 times [2019-11-28 17:24:35,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316276011] [2019-11-28 17:24:35,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,551 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:35,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316276011] [2019-11-28 17:24:35,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:35,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663597720] [2019-11-28 17:24:35,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:35,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:35,556 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand 5 states. [2019-11-28 17:24:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,662 INFO L93 Difference]: Finished difference Result 553 states and 737 transitions. [2019-11-28 17:24:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:35,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:24:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,665 INFO L225 Difference]: With dead ends: 553 [2019-11-28 17:24:35,665 INFO L226 Difference]: Without dead ends: 457 [2019-11-28 17:24:35,667 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:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-28 17:24:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 190. [2019-11-28 17:24:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-28 17:24:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 248 transitions. [2019-11-28 17:24:35,698 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 248 transitions. Word has length 31 [2019-11-28 17:24:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,700 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 248 transitions. [2019-11-28 17:24:35,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 248 transitions. [2019-11-28 17:24:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:35,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,709 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:35,709 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1099927890, now seen corresponding path program 1 times [2019-11-28 17:24:35,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088804960] [2019-11-28 17:24:35,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:35,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:35,923 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:36,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:36 BoogieIcfgContainer [2019-11-28 17:24:36,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:36,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:36,119 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:36,119 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:36,121 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:33" (3/4) ... [2019-11-28 17:24:36,126 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:36,222 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:36,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:36,225 INFO L168 Benchmark]: Toolchain (without parser) took 4622.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -228.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:36,225 INFO L168 Benchmark]: CDTParser took 0.96 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:36,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.24 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,227 INFO L168 Benchmark]: Boogie Preprocessor took 49.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:36,227 INFO L168 Benchmark]: RCFGBuilder took 1018.07 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: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,228 INFO L168 Benchmark]: TraceAbstraction took 2690.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -168.0 MB). Peak memory consumption was 234.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,229 INFO L168 Benchmark]: Witness Printer took 103.56 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,232 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.96 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.24 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1018.07 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: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2690.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -168.0 MB). Peak memory consumption was 234.8 MB. Max. memory is 11.5 GB. * Witness Printer took 103.56 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 388]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L76] int waterLevel = 1; [L77] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L395] int pumpRunning = 0; [L396] int systemActive = 1; [L769] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L258] int retValue_acc ; [L259] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L307] int retValue_acc ; [L310] retValue_acc = 1 [L311] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L265] tmp = valid_product() [L267] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L318] int splverifierCounter ; [L319] int tmp ; [L320] int tmp___0 ; [L321] int tmp___1 ; [L322] int tmp___2 ; [L325] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L327] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L329] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] tmp = __VERIFIER_nondet_int() [L337] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L94] COND TRUE waterLevel < 2 [L95] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L345] tmp___0 = __VERIFIER_nondet_int() [L347] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L106] COND FALSE !(\read(methaneLevelCritical)) [L109] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L355] tmp___2 = __VERIFIER_nondet_int() [L357] COND TRUE \read(tmp___2) [L595] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L402] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L409] COND TRUE \read(systemActive) [L457] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L460] COND FALSE !(\read(pumpRunning)) [L431] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L434] COND TRUE ! pumpRunning [L554] int retValue_acc ; [L555] int tmp ; [L556] int tmp___0 ; [L156] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L159] COND FALSE !(waterLevel < 2) [L163] retValue_acc = 0 [L164] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L560] tmp = isHighWaterSensorDry() [L562] COND FALSE !(\read(tmp)) [L565] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L567] retValue_acc = tmp___0 [L568] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L436] tmp = isHighWaterLevel() [L438] COND TRUE \read(tmp) [L485] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L115] int retValue_acc ; [L118] retValue_acc = methaneLevelCritical [L119] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = isMethaneLevelCritical() [L51] COND TRUE \read(tmp) [L509] int retValue_acc ; [L512] retValue_acc = pumpRunning [L513] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L388] __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, 117 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 828 SDtfs, 1030 SDslu, 1038 SDs, 0 SdLazy, 141 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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=190occurred 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, 468 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 11349 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...