./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product41_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_product41_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 5a2d3ce20e3d26ebf70024607ecab77b852f9995 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:46:15,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:46:15,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:46:15,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:46:15,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:46:15,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:46:15,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:46:15,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:46:15,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:46:15,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:46:15,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:46:15,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:46:15,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:46:15,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:46:15,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:46:15,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:46:15,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:46:15,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:46:15,193 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:46:15,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:46:15,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:46:15,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:46:15,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:46:15,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:46:15,201 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:46:15,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:46:15,203 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:46:15,204 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:46:15,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:46:15,205 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:46:15,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:46:15,206 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:46:15,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:46:15,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:46:15,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:46:15,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:46:15,209 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:46:15,232 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:46:15,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:46:15,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:46:15,234 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:46:15,234 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:46:15,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:46:15,234 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:46:15,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:46:15,235 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:46:15,235 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:46:15,235 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:46:15,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:46:15,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:46:15,236 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:46:15,236 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:46:15,236 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:46:15,236 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:46:15,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:46:15,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:46:15,237 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:46:15,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:46:15,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:15,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:46:15,237 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:46:15,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:46:15,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:46:15,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:46:15,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:46:15,238 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 -> 5a2d3ce20e3d26ebf70024607ecab77b852f9995 [2019-01-12 14:46:15,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:46:15,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:46:15,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:46:15,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:46:15,302 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:46:15,303 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product41_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:15,366 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa03a8b28/230665b3a3c9415aa403d01557c86c0d/FLAGf0a8728fd [2019-01-12 14:46:15,883 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:46:15,884 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product41_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:15,914 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa03a8b28/230665b3a3c9415aa403d01557c86c0d/FLAGf0a8728fd [2019-01-12 14:46:16,162 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa03a8b28/230665b3a3c9415aa403d01557c86c0d [2019-01-12 14:46:16,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:16,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:16,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:16,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:16,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:16,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:16,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16, skipping insertion in model container [2019-01-12 14:46:16,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:16,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:16,256 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:16,628 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:16,645 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:16,780 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:16,918 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:16,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16 WrapperNode [2019-01-12 14:46:16,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:16,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:16,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:16,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:16,928 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:46:16" (1/1) ... [2019-01-12 14:46:16,961 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:46:16" (1/1) ... [2019-01-12 14:46:17,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:17,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:17,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:17,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:17,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:17,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:17,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:17,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:17,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:17,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:17,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (1/1) ... [2019-01-12 14:46:17,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:17,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:17,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:17,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:17,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (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:46:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:17,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:18,546 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:18,546 INFO L286 CfgBuilder]: Removed 114 assue(true) statements. [2019-01-12 14:46:18,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:18 BoogieIcfgContainer [2019-01-12 14:46:18,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:18,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:18,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:18,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:18,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:16" (1/3) ... [2019-01-12 14:46:18,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c86db9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:18, skipping insertion in model container [2019-01-12 14:46:18,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:16" (2/3) ... [2019-01-12 14:46:18,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c86db9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:18, skipping insertion in model container [2019-01-12 14:46:18,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:18" (3/3) ... [2019-01-12 14:46:18,561 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product41_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:18,574 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:18,583 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:18,601 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:18,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:18,639 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:18,639 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:18,640 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:18,640 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:18,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:18,641 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:18,641 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:18,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-01-12 14:46:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:46:18,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:18,681 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:46:18,684 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:18,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1847621448, now seen corresponding path program 1 times [2019-01-12 14:46:18,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:18,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:18,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:18,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:18,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:18,963 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:46:18,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:18,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:18,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:18,982 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2019-01-12 14:46:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:19,009 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2019-01-12 14:46:19,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:19,010 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:46:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:19,023 INFO L225 Difference]: With dead ends: 168 [2019-01-12 14:46:19,023 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 14:46:19,027 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:46:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 14:46:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-12 14:46:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 14:46:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2019-01-12 14:46:19,071 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 16 [2019-01-12 14:46:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:19,072 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2019-01-12 14:46:19,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2019-01-12 14:46:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:46:19,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:19,073 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:46:19,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash 800864551, now seen corresponding path program 1 times [2019-01-12 14:46:19,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:19,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:19,239 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:46:19,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:19,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:46:19,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:19,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:19,243 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand 3 states. [2019-01-12 14:46:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:19,264 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2019-01-12 14:46:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:19,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:46:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:19,266 INFO L225 Difference]: With dead ends: 83 [2019-01-12 14:46:19,266 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 14:46:19,267 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:46:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 14:46:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-12 14:46:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-12 14:46:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-01-12 14:46:19,273 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 17 [2019-01-12 14:46:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:19,274 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-01-12 14:46:19,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-01-12 14:46:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:46:19,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:19,275 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:46:19,276 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:19,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2126819203, now seen corresponding path program 1 times [2019-01-12 14:46:19,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:19,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:19,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:19,404 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:46:19,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:19,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:19,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:19,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:19,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:19,406 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 3 states. [2019-01-12 14:46:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:19,426 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2019-01-12 14:46:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:19,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 14:46:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:19,428 INFO L225 Difference]: With dead ends: 68 [2019-01-12 14:46:19,428 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 14:46:19,429 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:46:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 14:46:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-12 14:46:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-12 14:46:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-01-12 14:46:19,435 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2019-01-12 14:46:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:19,436 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-12 14:46:19,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2019-01-12 14:46:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:46:19,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:19,437 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:46:19,437 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash -306622024, now seen corresponding path program 1 times [2019-01-12 14:46:19,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:19,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:19,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:19,534 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:46:19,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:19,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:19,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:19,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:19,537 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-01-12 14:46:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:19,624 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2019-01-12 14:46:19,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:19,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 14:46:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:19,626 INFO L225 Difference]: With dead ends: 89 [2019-01-12 14:46:19,626 INFO L226 Difference]: Without dead ends: 58 [2019-01-12 14:46:19,627 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:46:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-12 14:46:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-01-12 14:46:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 14:46:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2019-01-12 14:46:19,636 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 23 [2019-01-12 14:46:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:19,637 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2019-01-12 14:46:19,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2019-01-12 14:46:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 14:46:19,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:19,638 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:46:19,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:19,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:19,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1880803796, now seen corresponding path program 1 times [2019-01-12 14:46:19,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:19,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:19,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:19,900 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:46:19,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:19,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:19,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:19,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:19,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:19,902 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand 5 states. [2019-01-12 14:46:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:20,185 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2019-01-12 14:46:20,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:46:20,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-12 14:46:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:20,190 INFO L225 Difference]: With dead ends: 266 [2019-01-12 14:46:20,190 INFO L226 Difference]: Without dead ends: 216 [2019-01-12 14:46:20,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-12 14:46:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 100. [2019-01-12 14:46:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 14:46:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2019-01-12 14:46:20,221 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 29 [2019-01-12 14:46:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:20,221 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2019-01-12 14:46:20,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2019-01-12 14:46:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:46:20,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:20,228 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:46:20,228 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash 634718134, now seen corresponding path program 1 times [2019-01-12 14:46:20,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:20,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:20,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:20,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:20,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:20,532 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:46:20,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:20,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:20,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:20,534 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand 5 states. [2019-01-12 14:46:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:21,094 INFO L93 Difference]: Finished difference Result 280 states and 394 transitions. [2019-01-12 14:46:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:21,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:46:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:21,100 INFO L225 Difference]: With dead ends: 280 [2019-01-12 14:46:21,100 INFO L226 Difference]: Without dead ends: 278 [2019-01-12 14:46:21,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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:46:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-12 14:46:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-01-12 14:46:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 14:46:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2019-01-12 14:46:21,123 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 30 [2019-01-12 14:46:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:21,123 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2019-01-12 14:46:21,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2019-01-12 14:46:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:21,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:21,125 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, 1, 1] [2019-01-12 14:46:21,126 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash 719357973, now seen corresponding path program 1 times [2019-01-12 14:46:21,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:21,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:21,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:21,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:21,392 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:46:21,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:21,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:21,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:21,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:21,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:21,394 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2019-01-12 14:46:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:21,726 INFO L93 Difference]: Finished difference Result 270 states and 372 transitions. [2019-01-12 14:46:21,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:21,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:46:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:21,729 INFO L225 Difference]: With dead ends: 270 [2019-01-12 14:46:21,729 INFO L226 Difference]: Without dead ends: 176 [2019-01-12 14:46:21,730 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:46:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-01-12 14:46:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 106. [2019-01-12 14:46:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-12 14:46:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-01-12 14:46:21,749 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 33 [2019-01-12 14:46:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:21,750 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-01-12 14:46:21,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-01-12 14:46:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:21,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:21,751 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, 1, 1] [2019-01-12 14:46:21,752 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash 132551959, now seen corresponding path program 1 times [2019-01-12 14:46:21,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:21,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:21,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:21,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:21,827 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:46:21,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:21,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:21,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:46:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:46:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:46:21,829 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 4 states. [2019-01-12 14:46:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:21,923 INFO L93 Difference]: Finished difference Result 252 states and 342 transitions. [2019-01-12 14:46:21,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:46:21,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-12 14:46:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:21,925 INFO L225 Difference]: With dead ends: 252 [2019-01-12 14:46:21,925 INFO L226 Difference]: Without dead ends: 152 [2019-01-12 14:46:21,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-12 14:46:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2019-01-12 14:46:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 14:46:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2019-01-12 14:46:21,957 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 33 [2019-01-12 14:46:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:21,958 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2019-01-12 14:46:21,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:46:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2019-01-12 14:46:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:21,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:21,965 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, 1, 1] [2019-01-12 14:46:21,965 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:21,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1147311719, now seen corresponding path program 1 times [2019-01-12 14:46:21,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:21,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:21,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:21,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:21,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:22,061 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:46:22,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:22,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:22,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:22,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:22,063 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand 3 states. [2019-01-12 14:46:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:22,191 INFO L93 Difference]: Finished difference Result 262 states and 352 transitions. [2019-01-12 14:46:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:22,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-12 14:46:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:22,193 INFO L225 Difference]: With dead ends: 262 [2019-01-12 14:46:22,193 INFO L226 Difference]: Without dead ends: 158 [2019-01-12 14:46:22,194 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:46:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-12 14:46:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-01-12 14:46:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-12 14:46:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2019-01-12 14:46:22,219 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 33 [2019-01-12 14:46:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:22,219 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2019-01-12 14:46:22,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2019-01-12 14:46:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:46:22,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:22,221 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, 1, 1, 1] [2019-01-12 14:46:22,221 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:22,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:22,222 INFO L82 PathProgramCache]: Analyzing trace with hash 9984219, now seen corresponding path program 1 times [2019-01-12 14:46:22,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:22,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:22,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:22,429 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:46:22,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:22,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:46:22,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:46:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:46:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:46:22,431 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand 6 states. [2019-01-12 14:46:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:23,621 INFO L93 Difference]: Finished difference Result 482 states and 630 transitions. [2019-01-12 14:46:23,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:46:23,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-12 14:46:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:23,625 INFO L225 Difference]: With dead ends: 482 [2019-01-12 14:46:23,625 INFO L226 Difference]: Without dead ends: 330 [2019-01-12 14:46:23,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:46:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-12 14:46:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 158. [2019-01-12 14:46:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-12 14:46:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2019-01-12 14:46:23,654 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 34 [2019-01-12 14:46:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:23,654 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2019-01-12 14:46:23,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:46:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2019-01-12 14:46:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 14:46:23,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:23,657 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2019-01-12 14:46:23,658 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1795003067, now seen corresponding path program 1 times [2019-01-12 14:46:23,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:23,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:23,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:23,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:24,308 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:24,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:24 BoogieIcfgContainer [2019-01-12 14:46:24,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:24,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:24,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:24,480 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:24,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:18" (3/4) ... [2019-01-12 14:46:24,485 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:24,655 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:24,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:24,656 INFO L168 Benchmark]: Toolchain (without parser) took 8487.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:24,657 INFO L168 Benchmark]: CDTParser took 0.19 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:46:24,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:24,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:24,659 INFO L168 Benchmark]: Boogie Preprocessor took 37.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:24,660 INFO L168 Benchmark]: RCFGBuilder took 1501.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:24,662 INFO L168 Benchmark]: TraceAbstraction took 5930.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -49.4 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:24,663 INFO L168 Benchmark]: Witness Printer took 175.55 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: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:24,668 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.19 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 747.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1501.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5930.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -49.4 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * Witness Printer took 175.55 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: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 887]: 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; [L480] int waterLevel = 1; [L481] int methaneLevelCritical = 0; [L578] int pumpRunning = 0; [L579] int systemActive = 1; [L749] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L825] int retValue_acc ; [L826] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L874] int retValue_acc ; [L877] retValue_acc = 1 [L878] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L832] tmp = valid_product() [L834] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L411] int splverifierCounter ; [L412] int tmp ; [L413] int tmp___0 ; [L414] int tmp___1 ; [L415] int tmp___2 ; [L418] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L420] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L428] tmp = __VERIFIER_nondet_int() [L430] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L498] COND TRUE waterLevel < 2 [L499] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L438] tmp___0 = __VERIFIER_nondet_int() [L440] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L448] tmp___2 = __VERIFIER_nondet_int() [L450] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L586] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L593] COND TRUE \read(systemActive) [L615] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L618] COND TRUE ! pumpRunning [L730] int retValue_acc ; [L731] int tmp ; [L732] int tmp___0 ; [L560] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L563] COND FALSE !(waterLevel < 2) [L567] retValue_acc = 0 [L568] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L736] tmp = isHighWaterSensorDry() [L738] COND FALSE !(\read(tmp)) [L741] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L743] retValue_acc = tmp___0 [L744] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L620] tmp = isHighWaterLevel() [L622] COND TRUE \read(tmp) [L649] int tmp ; [L674] int retValue_acc ; [L519] int retValue_acc ; [L522] retValue_acc = methaneLevelCritical [L523] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L678] retValue_acc = isMethaneLevelCritical() [L680] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L653] tmp = isMethaneAlarm() [L655] COND FALSE !(\read(tmp)) [L643] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L893] int tmp ; [L894] int tmp___0 ; [L519] int retValue_acc ; [L522] retValue_acc = methaneLevelCritical [L523] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L898] tmp = isMethaneLevelCritical() [L900] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L420] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L422] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L428] tmp = __VERIFIER_nondet_int() [L430] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L438] tmp___0 = __VERIFIER_nondet_int() [L440] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L510] COND FALSE !(\read(methaneLevelCritical)) [L513] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L448] tmp___2 = __VERIFIER_nondet_int() [L450] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L586] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L486] COND TRUE waterLevel > 0 [L487] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L593] COND TRUE \read(systemActive) [L615] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L618] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L893] int tmp ; [L894] int tmp___0 ; [L519] int retValue_acc ; [L522] retValue_acc = methaneLevelCritical [L523] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L898] tmp = isMethaneLevelCritical() [L900] COND TRUE \read(tmp) [L685] int retValue_acc ; [L688] retValue_acc = pumpRunning [L689] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L902] tmp___0 = isPumpRunning() [L904] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L887] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 3 error locations. UNSAFE Result, 5.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 750 SDtfs, 911 SDslu, 1174 SDs, 0 SdLazy, 164 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred 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, 10 MinimizatonAttempts, 580 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 14010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...