./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product33_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/product-lines/minepump_spec1_product33_false-unreach-call_false-termination.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 3e754f75ca06d39e1069a0bad88498ddd2436bb7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:45:31,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:45:31,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:45:31,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:45:31,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:45:31,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:45:31,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:45:31,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:45:31,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:45:31,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:45:31,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:45:31,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:45:31,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:45:31,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:45:31,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:45:31,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:45:31,289 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:45:31,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:45:31,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:45:31,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:45:31,309 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:45:31,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:45:31,317 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:45:31,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:45:31,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:45:31,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:45:31,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:45:31,320 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:45:31,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:45:31,322 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:45:31,322 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:45:31,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:45:31,323 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:45:31,323 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:45:31,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:45:31,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:45:31,325 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:45:31,339 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:45:31,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:45:31,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:45:31,341 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:45:31,341 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:45:31,341 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:45:31,341 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:45:31,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:45:31,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:45:31,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:45:31,342 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:45:31,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:45:31,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:45:31,342 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:45:31,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:45:31,343 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:45:31,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:45:31,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:45:31,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:45:31,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:45:31,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:45:31,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:45:31,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:45:31,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:45:31,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:45:31,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:45:31,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:45:31,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:45:31,345 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 3e754f75ca06d39e1069a0bad88498ddd2436bb7 [2019-01-12 14:45:31,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:45:31,393 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:45:31,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:45:31,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:45:31,401 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:45:31,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product33_false-unreach-call_false-termination.cil.c [2019-01-12 14:45:31,454 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864b2e7be/f1bc76eda234450595f82335664dde16/FLAG86d0ce06a [2019-01-12 14:45:31,954 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:45:31,955 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product33_false-unreach-call_false-termination.cil.c [2019-01-12 14:45:31,982 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864b2e7be/f1bc76eda234450595f82335664dde16/FLAG86d0ce06a [2019-01-12 14:45:32,245 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864b2e7be/f1bc76eda234450595f82335664dde16 [2019-01-12 14:45:32,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:45:32,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:45:32,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:45:32,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:45:32,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:45:32,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:32,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2ce30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32, skipping insertion in model container [2019-01-12 14:45:32,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:32,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:45:32,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:45:32,647 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:45:32,677 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:45:32,817 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:45:32,930 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:45:32,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32 WrapperNode [2019-01-12 14:45:32,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:45:32,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:45:32,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:45:32,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:45:32,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:32,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:33,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:45:33,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:45:33,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:45:33,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:45:33,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:33,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:33,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:33,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:33,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:33,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:33,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (1/1) ... [2019-01-12 14:45:33,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:45:33,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:45:33,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:45:33,049 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:45:33,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45: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-01-12 14:45:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:45:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:45:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:45:33,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:45:34,383 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:45:34,383 INFO L286 CfgBuilder]: Removed 96 assue(true) statements. [2019-01-12 14:45:34,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:45:34 BoogieIcfgContainer [2019-01-12 14:45:34,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:45:34,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:45:34,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:45:34,390 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:45:34,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:45:32" (1/3) ... [2019-01-12 14:45:34,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:45:34, skipping insertion in model container [2019-01-12 14:45:34,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:32" (2/3) ... [2019-01-12 14:45:34,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:45:34, skipping insertion in model container [2019-01-12 14:45:34,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:45:34" (3/3) ... [2019-01-12 14:45:34,395 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product33_false-unreach-call_false-termination.cil.c [2019-01-12 14:45:34,405 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:45:34,413 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:45:34,430 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:45:34,462 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:45:34,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:45:34,463 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:45:34,463 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:45:34,464 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:45:34,464 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:45:34,464 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:45:34,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:45:34,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:45:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-01-12 14:45:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:45:34,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:34,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:45:34,489 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash 768274677, now seen corresponding path program 1 times [2019-01-12 14:45:34,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:34,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:34,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:34,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:34,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:45:34,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:45:34,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:45:34,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:45:34,764 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-01-12 14:45:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:34,794 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-01-12 14:45:34,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:45:34,796 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:45:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:34,810 INFO L225 Difference]: With dead ends: 150 [2019-01-12 14:45:34,810 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 14:45:34,815 INFO L631 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-01-12 14:45:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 14:45:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 14:45:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 14:45:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-01-12 14:45:34,870 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-01-12 14:45:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:34,870 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-01-12 14:45:34,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:45:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-01-12 14:45:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:45:34,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:34,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:45:34,872 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1484097871, now seen corresponding path program 1 times [2019-01-12 14:45:34,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:34,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:34,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:34,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:34,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:35,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:35,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:45:35,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:45:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:45:35,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:45:35,090 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-01-12 14:45:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:35,123 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-01-12 14:45:35,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:45:35,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:45:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:35,126 INFO L225 Difference]: With dead ends: 74 [2019-01-12 14:45:35,126 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 14:45:35,129 INFO L631 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-01-12 14:45:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 14:45:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-12 14:45:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 14:45:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-01-12 14:45:35,138 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-01-12 14:45:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:35,140 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-01-12 14:45:35,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:45:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-01-12 14:45:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:45:35,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:35,143 INFO L402 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-01-12 14:45:35,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 670124178, now seen corresponding path program 1 times [2019-01-12 14:45:35,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:35,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:35,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:35,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:35,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:35,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:45:35,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:45:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:45:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:45:35,254 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. [2019-01-12 14:45:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:35,273 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-01-12 14:45:35,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:45:35,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 14:45:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:35,275 INFO L225 Difference]: With dead ends: 62 [2019-01-12 14:45:35,276 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 14:45:35,277 INFO L631 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-01-12 14:45:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 14:45:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-12 14:45:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 14:45:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-01-12 14:45:35,283 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-01-12 14:45:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:35,284 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-12 14:45:35,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:45:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-01-12 14:45:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:45:35,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:35,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:45:35,286 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:35,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1804645939, now seen corresponding path program 1 times [2019-01-12 14:45:35,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:35,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:35,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:35,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:35,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:35,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:45:35,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:45:35,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:45:35,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:45:35,406 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-01-12 14:45:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:35,561 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-01-12 14:45:35,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:45:35,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 14:45:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:35,564 INFO L225 Difference]: With dead ends: 83 [2019-01-12 14:45:35,568 INFO L226 Difference]: Without dead ends: 55 [2019-01-12 14:45:35,569 INFO L631 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-01-12 14:45:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-12 14:45:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-01-12 14:45:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 14:45:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-01-12 14:45:35,593 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-01-12 14:45:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:35,594 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-01-12 14:45:35,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:45:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-01-12 14:45:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 14:45:35,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:35,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:45:35,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1746371458, now seen corresponding path program 1 times [2019-01-12 14:45:35,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:35,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:35,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:35,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:45:35,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:45:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:45:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:45:35,918 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-01-12 14:45:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:36,169 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-01-12 14:45:36,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:45:36,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-12 14:45:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:36,175 INFO L225 Difference]: With dead ends: 139 [2019-01-12 14:45:36,175 INFO L226 Difference]: Without dead ends: 92 [2019-01-12 14:45:36,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:45:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-12 14:45:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-01-12 14:45:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 14:45:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-01-12 14:45:36,200 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-01-12 14:45:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:36,200 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-01-12 14:45:36,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:45:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-01-12 14:45:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 14:45:36,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:36,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:45:36,202 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 916139585, now seen corresponding path program 1 times [2019-01-12 14:45:36,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:36,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:36,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:36,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:45:36,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:45:36,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:45:36,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:45:36,334 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2019-01-12 14:45:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:36,717 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-01-12 14:45:36,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:45:36,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-12 14:45:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:36,721 INFO L225 Difference]: With dead ends: 270 [2019-01-12 14:45:36,723 INFO L226 Difference]: Without dead ends: 220 [2019-01-12 14:45:36,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:45:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-12 14:45:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 100. [2019-01-12 14:45:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 14:45:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2019-01-12 14:45:36,750 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 29 [2019-01-12 14:45:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:36,750 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2019-01-12 14:45:36,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:45:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2019-01-12 14:45:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:45:36,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:36,753 INFO L402 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-01-12 14:45:36,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash -863305781, now seen corresponding path program 1 times [2019-01-12 14:45:36,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:36,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:36,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:36,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:36,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:36,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:36,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:45:36,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:45:36,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:45:36,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:45:36,867 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 5 states. [2019-01-12 14:45:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:37,409 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2019-01-12 14:45:37,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:45:37,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:45:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:37,413 INFO L225 Difference]: With dead ends: 280 [2019-01-12 14:45:37,413 INFO L226 Difference]: Without dead ends: 278 [2019-01-12 14:45:37,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:45:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-12 14:45:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-01-12 14:45:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 14:45:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2019-01-12 14:45:37,437 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 30 [2019-01-12 14:45:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:37,437 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2019-01-12 14:45:37,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:45:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2019-01-12 14:45:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:45:37,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:37,440 INFO L402 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-01-12 14:45:37,441 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash 376123462, now seen corresponding path program 1 times [2019-01-12 14:45:37,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:37,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:37,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:37,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:45:37,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:45:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:45:37,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:45:37,701 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 5 states. [2019-01-12 14:45:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:37,827 INFO L93 Difference]: Finished difference Result 276 states and 374 transitions. [2019-01-12 14:45:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:45:37,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:45:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:37,831 INFO L225 Difference]: With dead ends: 276 [2019-01-12 14:45:37,831 INFO L226 Difference]: Without dead ends: 182 [2019-01-12 14:45:37,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:45:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-12 14:45:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 104. [2019-01-12 14:45:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 14:45:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2019-01-12 14:45:37,852 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 30 [2019-01-12 14:45:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:37,853 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2019-01-12 14:45:37,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:45:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2019-01-12 14:45:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:45:37,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:37,856 INFO L402 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-01-12 14:45:37,856 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash 634288900, now seen corresponding path program 1 times [2019-01-12 14:45:37,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:37,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:37,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:37,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:37,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:45:37,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:45:37,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:45:37,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:45:37,923 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand 3 states. [2019-01-12 14:45:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:38,035 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2019-01-12 14:45:38,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:45:38,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-12 14:45:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:38,038 INFO L225 Difference]: With dead ends: 250 [2019-01-12 14:45:38,039 INFO L226 Difference]: Without dead ends: 152 [2019-01-12 14:45:38,039 INFO L631 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-01-12 14:45:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-12 14:45:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-01-12 14:45:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-12 14:45:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2019-01-12 14:45:38,066 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2019-01-12 14:45:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:38,067 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2019-01-12 14:45:38,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:45:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2019-01-12 14:45:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:45:38,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:38,071 INFO L402 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-01-12 14:45:38,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1373527294, now seen corresponding path program 1 times [2019-01-12 14:45:38,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:38,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:38,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:38,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:38,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:45:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:45:38,870 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:45:38,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:45:38 BoogieIcfgContainer [2019-01-12 14:45:38,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:45:38,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:45:38,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:45:38,998 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:45:38,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:45:34" (3/4) ... [2019-01-12 14:45:39,002 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:45:39,115 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:45:39,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:45:39,116 INFO L168 Benchmark]: Toolchain (without parser) took 6867.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:39,119 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:45:39,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:39,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:39,121 INFO L168 Benchmark]: Boogie Preprocessor took 38.88 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-01-12 14:45:39,122 INFO L168 Benchmark]: RCFGBuilder took 1336.19 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:39,122 INFO L168 Benchmark]: TraceAbstraction took 4610.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.3 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:39,124 INFO L168 Benchmark]: Witness Printer took 118.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:39,129 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 681.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.88 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 1336.19 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4610.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.3 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. * Witness Printer took 118.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 410]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L424] int pumpRunning = 0; [L425] int systemActive = 1; [L683] int cleanupTimeShifts = 4; [L806] int waterLevel = 1; [L807] int methaneLevelCritical = 0; [L756] int retValue_acc ; [L757] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L674] int retValue_acc ; [L677] retValue_acc = 1 [L678] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L763] tmp = valid_product() [L765] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L581] int splverifierCounter ; [L582] int tmp ; [L583] int tmp___0 ; [L584] int tmp___1 ; [L585] int tmp___2 ; [L588] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L590] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L592] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L598] tmp = __VERIFIER_nondet_int() [L600] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] COND TRUE waterLevel < 2 [L825] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] tmp___0 = __VERIFIER_nondet_int() [L610] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L836] COND FALSE !(\read(methaneLevelCritical)) [L839] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L618] tmp___2 = __VERIFIER_nondet_int() [L620] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] COND TRUE \read(systemActive) [L461] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L464] COND TRUE ! pumpRunning [L558] int retValue_acc ; [L559] int tmp ; [L560] int tmp___0 ; [L886] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L889] COND FALSE !(waterLevel < 2) [L893] retValue_acc = 0 [L894] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L564] tmp = isHighWaterSensorDry() [L566] COND FALSE !(\read(tmp)) [L569] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L571] retValue_acc = tmp___0 [L572] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] tmp = isHighWaterLevel() [L468] COND TRUE \read(tmp) [L489] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L780] int tmp ; [L781] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = methaneLevelCritical [L849] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L785] tmp = isMethaneLevelCritical() [L787] COND TRUE \read(tmp) [L513] int retValue_acc ; [L516] retValue_acc = pumpRunning [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L789] tmp___0 = isPumpRunning() [L791] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L410] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 3 error locations. UNSAFE Result, 4.5s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 577 SDtfs, 704 SDslu, 767 SDs, 0 SdLazy, 102 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 414 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 12233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...