./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product40_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_spec4_product40_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 a7dbd4e152ee971b4407c7068d06d15a4635d510 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:48:44,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:48:44,924 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:48:44,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:48:44,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:48:44,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:48:44,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:48:44,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:48:44,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:48:44,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:48:44,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:48:44,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:48:44,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:48:44,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:48:44,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:48:44,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:48:44,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:48:44,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:48:44,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:48:44,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:48:44,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:48:44,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:48:44,963 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:48:44,963 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:48:44,963 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:48:44,964 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:48:44,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:48:44,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:48:44,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:48:44,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:48:44,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:48:44,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:48:44,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:48:44,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:48:44,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:48:44,973 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:48:44,973 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:48:45,001 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:48:45,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:48:45,003 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:48:45,004 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:48:45,004 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:48:45,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:48:45,004 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:48:45,004 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:48:45,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:48:45,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:48:45,005 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:48:45,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:48:45,005 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:48:45,005 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:48:45,006 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:48:45,006 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:48:45,007 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:48:45,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:48:45,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:48:45,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:48:45,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:48:45,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:45,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:48:45,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:48:45,009 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:48:45,009 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:48:45,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:48:45,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:48:45,010 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 -> a7dbd4e152ee971b4407c7068d06d15a4635d510 [2019-01-12 14:48:45,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:48:45,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:48:45,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:48:45,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:48:45,077 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:48:45,078 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product40_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:45,137 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f3bf096/9e2e6c5fae364d748fcb4c4164f795e8/FLAGa81e822d4 [2019-01-12 14:48:45,701 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:48:45,705 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product40_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:45,727 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f3bf096/9e2e6c5fae364d748fcb4c4164f795e8/FLAGa81e822d4 [2019-01-12 14:48:45,963 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f3bf096/9e2e6c5fae364d748fcb4c4164f795e8 [2019-01-12 14:48:45,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:48:45,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:48:45,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:45,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:48:45,973 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:48:45,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:45" (1/1) ... [2019-01-12 14:48:45,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bc7883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:45, skipping insertion in model container [2019-01-12 14:48:45,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:45" (1/1) ... [2019-01-12 14:48:45,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:48:46,038 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:48:46,360 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:46,375 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:48:46,507 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:46,627 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:48:46,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46 WrapperNode [2019-01-12 14:48:46,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:46,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:46,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:48:46,629 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:48:46,638 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:48:46" (1/1) ... [2019-01-12 14:48:46,660 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:48:46" (1/1) ... [2019-01-12 14:48:46,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:46,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:48:46,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:48:46,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:48:46,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (1/1) ... [2019-01-12 14:48:46,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (1/1) ... [2019-01-12 14:48:46,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (1/1) ... [2019-01-12 14:48:46,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (1/1) ... [2019-01-12 14:48:46,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (1/1) ... [2019-01-12 14:48:46,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (1/1) ... [2019-01-12 14:48:46,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (1/1) ... [2019-01-12 14:48:46,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:48:46,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:48:46,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:48:46,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:48:46,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (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:48:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:48:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:48:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:48:46,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:48:48,287 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:48:48,287 INFO L286 CfgBuilder]: Removed 162 assue(true) statements. [2019-01-12 14:48:48,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:48 BoogieIcfgContainer [2019-01-12 14:48:48,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:48:48,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:48:48,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:48:48,293 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:48:48,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:48:45" (1/3) ... [2019-01-12 14:48:48,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1bcfa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:48:48, skipping insertion in model container [2019-01-12 14:48:48,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:46" (2/3) ... [2019-01-12 14:48:48,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1bcfa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:48:48, skipping insertion in model container [2019-01-12 14:48:48,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:48" (3/3) ... [2019-01-12 14:48:48,296 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product40_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:48,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:48:48,311 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:48:48,327 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:48:48,356 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:48:48,357 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:48:48,357 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:48:48,357 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:48:48,358 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:48:48,358 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:48:48,358 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:48:48,358 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:48:48,358 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:48:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-12 14:48:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:48:48,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:48,384 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:48:48,386 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2074315904, now seen corresponding path program 1 times [2019-01-12 14:48:48,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:48,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:48,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:48,624 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:48:48,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:48,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:48:48,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:48:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:48:48,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:48:48,649 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-12 14:48:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:48,684 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-01-12 14:48:48,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:48:48,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:48:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:48,698 INFO L225 Difference]: With dead ends: 220 [2019-01-12 14:48:48,699 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 14:48:48,702 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:48:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 14:48:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-12 14:48:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-12 14:48:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-01-12 14:48:48,745 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-01-12 14:48:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:48,745 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-01-12 14:48:48,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:48:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-01-12 14:48:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:48:48,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:48,747 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:48:48,747 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1027559007, now seen corresponding path program 1 times [2019-01-12 14:48:48,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:48,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:48,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:48,859 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:48:48,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:48,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:48:48,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:48:48,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:48:48,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:48:48,862 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-01-12 14:48:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:48,890 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-01-12 14:48:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:48:48,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:48:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:48,893 INFO L225 Difference]: With dead ends: 109 [2019-01-12 14:48:48,893 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:48:48,897 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:48:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:48:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:48:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:48:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-01-12 14:48:48,909 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-01-12 14:48:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:48,911 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-01-12 14:48:48,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:48:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-01-12 14:48:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:48:48,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:48,912 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:48:48,913 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash 109011716, now seen corresponding path program 1 times [2019-01-12 14:48:48,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:48,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:48,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:49,120 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:48:49,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:49,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:48:49,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:49,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:49,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:49,122 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2019-01-12 14:48:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:49,351 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2019-01-12 14:48:49,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:49,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 14:48:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:49,353 INFO L225 Difference]: With dead ends: 111 [2019-01-12 14:48:49,353 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 14:48:49,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:48:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 14:48:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-01-12 14:48:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 14:48:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-01-12 14:48:49,364 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2019-01-12 14:48:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:49,364 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-01-12 14:48:49,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-01-12 14:48:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:48:49,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:49,366 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] [2019-01-12 14:48:49,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:49,367 INFO L82 PathProgramCache]: Analyzing trace with hash 60563277, now seen corresponding path program 1 times [2019-01-12 14:48:49,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:49,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:49,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:49,482 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:48:49,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:49,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:48:49,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:48:49,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:48:49,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:48:49,483 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2019-01-12 14:48:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:49,591 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2019-01-12 14:48:49,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:48:49,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:48:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:49,593 INFO L225 Difference]: With dead ends: 147 [2019-01-12 14:48:49,593 INFO L226 Difference]: Without dead ends: 87 [2019-01-12 14:48:49,594 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:48:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-12 14:48:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-01-12 14:48:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 14:48:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-01-12 14:48:49,605 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2019-01-12 14:48:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:49,606 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-01-12 14:48:49,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:48:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-01-12 14:48:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:48:49,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:49,607 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] [2019-01-12 14:48:49,607 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash -445763815, now seen corresponding path program 1 times [2019-01-12 14:48:49,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:49,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:49,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:49,940 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:48:49,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:49,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:48:49,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:48:49,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:48:49,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:48:49,942 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 8 states. [2019-01-12 14:48:50,416 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 14:48:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:51,649 INFO L93 Difference]: Finished difference Result 537 states and 787 transitions. [2019-01-12 14:48:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:48:51,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-12 14:48:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:51,654 INFO L225 Difference]: With dead ends: 537 [2019-01-12 14:48:51,654 INFO L226 Difference]: Without dead ends: 458 [2019-01-12 14:48:51,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:48:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-01-12 14:48:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 212. [2019-01-12 14:48:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-12 14:48:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 296 transitions. [2019-01-12 14:48:51,701 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 296 transitions. Word has length 25 [2019-01-12 14:48:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:51,704 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 296 transitions. [2019-01-12 14:48:51,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:48:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 296 transitions. [2019-01-12 14:48:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 14:48:51,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:51,710 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:48:51,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:51,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 371468141, now seen corresponding path program 1 times [2019-01-12 14:48:51,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:51,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:51,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:48:52,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:52,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:48:52,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:52,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:52,016 INFO L87 Difference]: Start difference. First operand 212 states and 296 transitions. Second operand 5 states. [2019-01-12 14:48:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:52,720 INFO L93 Difference]: Finished difference Result 498 states and 707 transitions. [2019-01-12 14:48:52,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:48:52,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-01-12 14:48:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:52,726 INFO L225 Difference]: With dead ends: 498 [2019-01-12 14:48:52,726 INFO L226 Difference]: Without dead ends: 496 [2019-01-12 14:48:52,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:48:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-01-12 14:48:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 212. [2019-01-12 14:48:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-12 14:48:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2019-01-12 14:48:52,765 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 41 [2019-01-12 14:48:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:52,765 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2019-01-12 14:48:52,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2019-01-12 14:48:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 14:48:52,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:52,770 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:48:52,770 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:52,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1694698835, now seen corresponding path program 1 times [2019-01-12 14:48:52,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:52,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:52,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:52,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:52,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:48:52,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:52,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:48:52,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:52,895 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand 5 states. [2019-01-12 14:48:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:53,136 INFO L93 Difference]: Finished difference Result 647 states and 890 transitions. [2019-01-12 14:48:53,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:53,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 14:48:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:53,149 INFO L225 Difference]: With dead ends: 647 [2019-01-12 14:48:53,149 INFO L226 Difference]: Without dead ends: 441 [2019-01-12 14:48:53,153 INFO L631 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-01-12 14:48:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-01-12 14:48:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 227. [2019-01-12 14:48:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-12 14:48:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2019-01-12 14:48:53,197 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 48 [2019-01-12 14:48:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:53,199 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2019-01-12 14:48:53,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2019-01-12 14:48:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 14:48:53,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:53,211 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:48:53,212 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1301671825, now seen corresponding path program 1 times [2019-01-12 14:48:53,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:53,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:53,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:48:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:53,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:48:53,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:48:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:48:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:48:53,624 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand 6 states. [2019-01-12 14:48:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:54,154 INFO L93 Difference]: Finished difference Result 604 states and 821 transitions. [2019-01-12 14:48:54,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:48:54,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-01-12 14:48:54,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:54,158 INFO L225 Difference]: With dead ends: 604 [2019-01-12 14:48:54,159 INFO L226 Difference]: Without dead ends: 383 [2019-01-12 14:48:54,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:48:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-01-12 14:48:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 205. [2019-01-12 14:48:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-12 14:48:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 274 transitions. [2019-01-12 14:48:54,211 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 274 transitions. Word has length 48 [2019-01-12 14:48:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:54,213 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 274 transitions. [2019-01-12 14:48:54,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:48:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 274 transitions. [2019-01-12 14:48:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 14:48:54,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:54,214 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:48:54,214 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:54,215 INFO L82 PathProgramCache]: Analyzing trace with hash -103400707, now seen corresponding path program 1 times [2019-01-12 14:48:54,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:54,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:54,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:54,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:54,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:48:54,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:48:54,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:48:54,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:54,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:48:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:48:54,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:48:54,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 14:48:54,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:48:54,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:48:54,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:48:54,809 INFO L87 Difference]: Start difference. First operand 205 states and 274 transitions. Second operand 8 states. [2019-01-12 14:48:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:55,863 INFO L93 Difference]: Finished difference Result 715 states and 980 transitions. [2019-01-12 14:48:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:48:55,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-01-12 14:48:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:55,868 INFO L225 Difference]: With dead ends: 715 [2019-01-12 14:48:55,868 INFO L226 Difference]: Without dead ends: 558 [2019-01-12 14:48:55,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:48:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-12 14:48:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 268. [2019-01-12 14:48:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-01-12 14:48:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2019-01-12 14:48:55,920 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 50 [2019-01-12 14:48:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:55,921 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2019-01-12 14:48:55,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:48:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2019-01-12 14:48:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:48:55,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:55,924 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:48:55,924 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1377844072, now seen corresponding path program 2 times [2019-01-12 14:48:55,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:55,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:55,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:55,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:55,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:48:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:48:56,811 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:48:56,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:48:56 BoogieIcfgContainer [2019-01-12 14:48:56,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:48:56,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:48:56,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:48:56,987 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:48:56,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:48" (3/4) ... [2019-01-12 14:48:56,991 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:48:57,197 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:48:57,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:48:57,198 INFO L168 Benchmark]: Toolchain (without parser) took 11230.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 944.6 MB in the beginning and 824.9 MB in the end (delta: 119.7 MB). Peak memory consumption was 326.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:57,199 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:48:57,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:57,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.17 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:48:57,200 INFO L168 Benchmark]: Boogie Preprocessor took 49.38 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:48:57,200 INFO L168 Benchmark]: RCFGBuilder took 1528.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:57,201 INFO L168 Benchmark]: TraceAbstraction took 8696.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 856.1 MB in the end (delta: 202.6 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:57,201 INFO L168 Benchmark]: Witness Printer took 210.43 ms. Allocated memory is still 1.2 GB. Free memory was 856.1 MB in the beginning and 824.9 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:57,205 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 659.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.17 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.38 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. * RCFGBuilder took 1528.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8696.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 856.1 MB in the end (delta: 202.6 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. * Witness Printer took 210.43 ms. Allocated memory is still 1.2 GB. Free memory was 856.1 MB in the beginning and 824.9 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 329]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L123] int pumpRunning = 0; [L124] int systemActive = 1; [L334] int cleanupTimeShifts = 4; [L434] int waterLevel = 1; [L435] int methaneLevelCritical = 0; [L697] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L410] int retValue_acc ; [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L946] int retValue_acc ; [L949] retValue_acc = 1 [L950] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] tmp = valid_product() [L419] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L47] int splverifierCounter ; [L48] int tmp ; [L49] int tmp___0 ; [L50] int tmp___1 ; [L51] int tmp___2 ; [L54] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L64] tmp = __VERIFIER_nondet_int() [L66] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L452] COND TRUE waterLevel < 2 [L453] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L320] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L131] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L138] COND TRUE \read(systemActive) [L186] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L189] COND FALSE !(\read(pumpRunning)) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L163] COND TRUE ! pumpRunning [L283] int retValue_acc ; [L284] int tmp ; [L285] int tmp___0 ; [L514] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L517] COND FALSE !(waterLevel < 2) [L521] retValue_acc = 0 [L522] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L289] tmp = isHighWaterSensorDry() [L291] COND FALSE !(\read(tmp)) [L294] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L296] retValue_acc = tmp___0 [L297] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L165] tmp = isHighWaterLevel() [L167] COND TRUE \read(tmp) [L214] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L895] int tmp ; [L896] int tmp___0 ; [L505] int retValue_acc ; [L508] retValue_acc = waterLevel [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L900] tmp = getWaterLevel() [L902] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L320] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L131] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L440] COND TRUE waterLevel > 0 [L441] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L138] COND TRUE \read(systemActive) [L186] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L189] COND TRUE \read(pumpRunning) [L227] int retValue_acc ; [L473] int retValue_acc ; [L476] retValue_acc = methaneLevelCritical [L477] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L231] retValue_acc = isMethaneLevelCritical() [L233] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L191] tmp = isMethaneAlarm() [L193] COND FALSE !(\read(tmp)) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L163] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L895] int tmp ; [L896] int tmp___0 ; [L505] int retValue_acc ; [L508] retValue_acc = waterLevel [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L900] tmp = getWaterLevel() [L902] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L320] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L131] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L440] COND TRUE waterLevel > 0 [L441] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L138] COND TRUE \read(systemActive) [L186] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L189] COND TRUE \read(pumpRunning) [L227] int retValue_acc ; [L473] int retValue_acc ; [L476] retValue_acc = methaneLevelCritical [L477] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L231] retValue_acc = isMethaneLevelCritical() [L233] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L191] tmp = isMethaneAlarm() [L193] COND FALSE !(\read(tmp)) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L163] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L895] int tmp ; [L896] int tmp___0 ; [L505] int retValue_acc ; [L508] retValue_acc = waterLevel [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L900] tmp = getWaterLevel() [L902] COND TRUE tmp == 0 [L238] int retValue_acc ; [L241] retValue_acc = pumpRunning [L242] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L904] tmp___0 = isPumpRunning() [L906] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L329] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 3 error locations. UNSAFE Result, 8.6s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 911 SDtfs, 1783 SDslu, 1953 SDs, 0 SdLazy, 309 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1218 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 24581 SizeOfPredicates, 4 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 65/71 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...