./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product40_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_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 ad65d1d3307a121fce5b7d95113e2f3f66b04b5a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 09:41:21,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:21,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:21,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:21,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:21,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:21,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:21,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:21,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:21,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:21,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:21,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:21,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:21,238 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:21,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:21,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:21,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:21,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:21,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:21,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:21,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:21,254 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:21,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:21,260 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:21,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:21,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:21,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:21,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:21,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:21,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:21,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:21,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:21,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:21,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:21,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:21,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:21,268 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:41:21,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:21,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:21,284 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:21,284 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:21,285 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:21,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:21,285 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:21,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:21,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:21,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:21,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:21,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:21,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:21,286 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:21,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:21,287 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:21,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:21,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:21,287 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:21,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:21,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:21,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:21,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:21,288 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:21,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:21,288 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:21,290 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:21,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:21,290 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 -> ad65d1d3307a121fce5b7d95113e2f3f66b04b5a [2018-12-31 09:41:21,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:21,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:21,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:21,358 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:21,358 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:21,360 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product40_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:21,425 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760872db5/6071e9c836fe4e33884549713cc50808/FLAG55878e579 [2018-12-31 09:41:21,955 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:21,956 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product40_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:21,982 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760872db5/6071e9c836fe4e33884549713cc50808/FLAG55878e579 [2018-12-31 09:41:22,260 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760872db5/6071e9c836fe4e33884549713cc50808 [2018-12-31 09:41:22,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:22,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:22,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:22,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:22,272 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:22,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:22,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22, skipping insertion in model container [2018-12-31 09:41:22,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:22,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:22,355 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:22,759 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:22,777 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:22,882 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:22,942 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:22,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22 WrapperNode [2018-12-31 09:41:22,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:22,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:22,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:22,945 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:22,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:23,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:23,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:23,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:23,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (1/1) ... [2018-12-31 09:41:23,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:23,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:23,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:23,148 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:23,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (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 [2018-12-31 09:41:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:23,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:24,484 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:24,485 INFO L280 CfgBuilder]: Removed 162 assue(true) statements. [2018-12-31 09:41:24,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:24 BoogieIcfgContainer [2018-12-31 09:41:24,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:24,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:24,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:24,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:24,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:22" (1/3) ... [2018-12-31 09:41:24,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8fe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:24, skipping insertion in model container [2018-12-31 09:41:24,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:22" (2/3) ... [2018-12-31 09:41:24,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8fe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:24, skipping insertion in model container [2018-12-31 09:41:24,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:24" (3/3) ... [2018-12-31 09:41:24,494 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product40_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:24,504 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:24,513 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:24,531 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:24,570 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:24,570 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:24,571 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:24,571 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:24,571 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:24,571 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:24,571 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:24,571 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:24,572 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-12-31 09:41:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:24,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:24,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:24,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2074315904, now seen corresponding path program 1 times [2018-12-31 09:41:24,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:24,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:24,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:24,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:24,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:24,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:24,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:24,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:24,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:24,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:24,925 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2018-12-31 09:41:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:24,962 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2018-12-31 09:41:24,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:24,964 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:24,979 INFO L225 Difference]: With dead ends: 220 [2018-12-31 09:41:24,979 INFO L226 Difference]: Without dead ends: 109 [2018-12-31 09:41:24,983 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 [2018-12-31 09:41:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-31 09:41:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-31 09:41:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-31 09:41:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2018-12-31 09:41:25,046 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2018-12-31 09:41:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:25,046 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2018-12-31 09:41:25,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2018-12-31 09:41:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:25,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:25,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:25,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1027559007, now seen corresponding path program 1 times [2018-12-31 09:41:25,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:25,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:25,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:25,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:25,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:25,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:25,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:25,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:25,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:25,275 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2018-12-31 09:41:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:25,298 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2018-12-31 09:41:25,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:25,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:25,300 INFO L225 Difference]: With dead ends: 109 [2018-12-31 09:41:25,300 INFO L226 Difference]: Without dead ends: 47 [2018-12-31 09:41:25,302 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 [2018-12-31 09:41:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-31 09:41:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-31 09:41:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 09:41:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2018-12-31 09:41:25,310 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2018-12-31 09:41:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:25,310 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2018-12-31 09:41:25,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2018-12-31 09:41:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:25,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:25,313 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] [2018-12-31 09:41:25,313 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:25,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:25,313 INFO L82 PathProgramCache]: Analyzing trace with hash 109011716, now seen corresponding path program 1 times [2018-12-31 09:41:25,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:25,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:25,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:25,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:25,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:25,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:25,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:25,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:25,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:25,465 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2018-12-31 09:41:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:25,659 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2018-12-31 09:41:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:25,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 09:41:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:25,662 INFO L225 Difference]: With dead ends: 111 [2018-12-31 09:41:25,663 INFO L226 Difference]: Without dead ends: 70 [2018-12-31 09:41:25,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:41:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-31 09:41:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-31 09:41:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 09:41:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2018-12-31 09:41:25,684 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2018-12-31 09:41:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:25,684 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2018-12-31 09:41:25,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2018-12-31 09:41:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:41:25,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:25,689 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] [2018-12-31 09:41:25,689 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash 60563277, now seen corresponding path program 1 times [2018-12-31 09:41:25,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:25,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:25,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:25,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:25,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:25,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:25,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:25,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:25,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:25,844 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2018-12-31 09:41:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:25,985 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2018-12-31 09:41:25,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:25,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:41:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:25,988 INFO L225 Difference]: With dead ends: 147 [2018-12-31 09:41:25,988 INFO L226 Difference]: Without dead ends: 87 [2018-12-31 09:41:25,989 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 [2018-12-31 09:41:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-31 09:41:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-12-31 09:41:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-31 09:41:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2018-12-31 09:41:26,003 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2018-12-31 09:41:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:26,003 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2018-12-31 09:41:26,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2018-12-31 09:41:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:26,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:26,005 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] [2018-12-31 09:41:26,006 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash -445763815, now seen corresponding path program 1 times [2018-12-31 09:41:26,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:26,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:26,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:26,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:26,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:26,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:26,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:26,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:26,125 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2018-12-31 09:41:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:26,547 INFO L93 Difference]: Finished difference Result 413 states and 601 transitions. [2018-12-31 09:41:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:26,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:41:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:26,553 INFO L225 Difference]: With dead ends: 413 [2018-12-31 09:41:26,553 INFO L226 Difference]: Without dead ends: 334 [2018-12-31 09:41:26,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-31 09:41:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 156. [2018-12-31 09:41:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-31 09:41:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2018-12-31 09:41:26,587 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 25 [2018-12-31 09:41:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:26,589 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2018-12-31 09:41:26,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2018-12-31 09:41:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:41:26,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:26,591 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] [2018-12-31 09:41:26,591 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash -649570909, now seen corresponding path program 1 times [2018-12-31 09:41:26,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:26,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:26,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:26,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:26,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:26,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:26,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:26,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:26,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:26,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:26,822 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand 5 states. [2018-12-31 09:41:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:27,587 INFO L93 Difference]: Finished difference Result 436 states and 619 transitions. [2018-12-31 09:41:27,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:41:27,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:41:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:27,592 INFO L225 Difference]: With dead ends: 436 [2018-12-31 09:41:27,592 INFO L226 Difference]: Without dead ends: 434 [2018-12-31 09:41:27,593 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 [2018-12-31 09:41:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-12-31 09:41:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 156. [2018-12-31 09:41:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-31 09:41:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2018-12-31 09:41:27,629 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 26 [2018-12-31 09:41:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:27,629 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2018-12-31 09:41:27,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2018-12-31 09:41:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:27,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:27,636 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] [2018-12-31 09:41:27,636 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash 108971892, now seen corresponding path program 1 times [2018-12-31 09:41:27,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:27,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:27,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:27,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:27,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:27,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:27,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:27,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:27,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:27,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:27,869 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand 5 states. [2018-12-31 09:41:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:28,513 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2018-12-31 09:41:28,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:28,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:41:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:28,515 INFO L225 Difference]: With dead ends: 468 [2018-12-31 09:41:28,516 INFO L226 Difference]: Without dead ends: 318 [2018-12-31 09:41:28,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:41:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-31 09:41:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 168. [2018-12-31 09:41:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-31 09:41:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2018-12-31 09:41:28,562 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 31 [2018-12-31 09:41:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:28,563 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2018-12-31 09:41:28,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2018-12-31 09:41:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:28,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:28,574 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] [2018-12-31 09:41:28,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:28,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:28,575 INFO L82 PathProgramCache]: Analyzing trace with hash -284055118, now seen corresponding path program 1 times [2018-12-31 09:41:28,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:28,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:28,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:28,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:28,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:28,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:28,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:41:28,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:41:28,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:41:28,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:41:28,764 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand 6 states. [2018-12-31 09:41:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:29,097 INFO L93 Difference]: Finished difference Result 502 states and 682 transitions. [2018-12-31 09:41:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:41:29,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-31 09:41:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:29,102 INFO L225 Difference]: With dead ends: 502 [2018-12-31 09:41:29,102 INFO L226 Difference]: Without dead ends: 340 [2018-12-31 09:41:29,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:41:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-12-31 09:41:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 176. [2018-12-31 09:41:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-31 09:41:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2018-12-31 09:41:29,136 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 31 [2018-12-31 09:41:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:29,137 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2018-12-31 09:41:29,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:41:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2018-12-31 09:41:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:29,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:29,139 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] [2018-12-31 09:41:29,139 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:29,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:29,140 INFO L82 PathProgramCache]: Analyzing trace with hash -25889680, now seen corresponding path program 1 times [2018-12-31 09:41:29,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:29,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:29,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:29,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:29,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:29,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:29,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:29,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:29,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:29,231 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand 3 states. [2018-12-31 09:41:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:29,376 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2018-12-31 09:41:29,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:29,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-31 09:41:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:29,379 INFO L225 Difference]: With dead ends: 434 [2018-12-31 09:41:29,380 INFO L226 Difference]: Without dead ends: 264 [2018-12-31 09:41:29,381 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 [2018-12-31 09:41:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-31 09:41:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-12-31 09:41:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-31 09:41:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 348 transitions. [2018-12-31 09:41:29,430 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 348 transitions. Word has length 31 [2018-12-31 09:41:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:29,431 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 348 transitions. [2018-12-31 09:41:29,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2018-12-31 09:41:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:41:29,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:29,437 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2138649550, now seen corresponding path program 1 times [2018-12-31 09:41:29,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:29,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:29,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:30,126 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:41:30,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:41:30 BoogieIcfgContainer [2018-12-31 09:41:30,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:41:30,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:41:30,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:41:30,293 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:41:30,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:24" (3/4) ... [2018-12-31 09:41:30,299 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:41:30,437 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:41:30,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:41:30,439 INFO L168 Benchmark]: Toolchain (without parser) took 8173.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 951.4 MB in the beginning and 748.9 MB in the end (delta: 202.4 MB). Peak memory consumption was 439.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:30,441 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:30,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -70.6 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:30,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 199.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.7 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:30,444 INFO L168 Benchmark]: Boogie Preprocessor took 55.03 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:41:30,444 INFO L168 Benchmark]: RCFGBuilder took 1338.98 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.8 MB). Peak memory consumption was 68.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:30,445 INFO L168 Benchmark]: TraceAbstraction took 5804.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 769.2 MB in the end (delta: 384.6 MB). Peak memory consumption was 384.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:30,446 INFO L168 Benchmark]: Witness Printer took 146.22 ms. Allocated memory is still 1.3 GB. Free memory was 769.2 MB in the beginning and 759.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:30,451 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 675.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -70.6 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 147.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 199.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.7 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.03 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1338.98 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.8 MB). Peak memory consumption was 68.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5804.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 769.2 MB in the end (delta: 384.6 MB). Peak memory consumption was 384.6 MB. Max. memory is 11.5 GB. * Witness Printer took 146.22 ms. Allocated memory is still 1.3 GB. Free memory was 769.2 MB in the beginning and 759.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 490]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L51] int pumpRunning = 0; [L52] int systemActive = 1; [L352] int cleanupTimeShifts = 4; [L664] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L862] int waterLevel = 1; [L863] int methaneLevelCritical = 0; [L428] int retValue_acc ; [L429] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L477] int retValue_acc ; [L480] retValue_acc = 1 [L481] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L435] tmp = valid_product() [L437] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int splverifierCounter ; [L258] int tmp ; [L259] int tmp___0 ; [L260] int tmp___1 ; [L261] int tmp___2 ; [L264] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L266] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L268] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L274] tmp = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L880] COND TRUE waterLevel < 2 [L881] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L284] tmp___0 = __VERIFIER_nondet_int() [L286] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L892] COND FALSE !(\read(methaneLevelCritical)) [L895] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L294] tmp___2 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp___2) [L248] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L59] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L66] COND TRUE \read(systemActive) [L114] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L117] COND FALSE !(\read(pumpRunning)) [L88] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L91] COND TRUE ! pumpRunning [L211] int retValue_acc ; [L212] int tmp ; [L213] int tmp___0 ; [L942] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L945] COND FALSE !(waterLevel < 2) [L949] retValue_acc = 0 [L950] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L217] tmp = isHighWaterSensorDry() [L219] COND FALSE !(\read(tmp)) [L222] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L224] retValue_acc = tmp___0 [L225] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L93] tmp = isHighWaterLevel() [L95] COND TRUE \read(tmp) [L142] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L327] int tmp ; [L328] int tmp___0 ; [L901] int retValue_acc ; [L904] retValue_acc = methaneLevelCritical [L905] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L332] tmp = isMethaneLevelCritical() [L334] COND TRUE \read(tmp) [L166] int retValue_acc ; [L169] retValue_acc = pumpRunning [L170] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L336] tmp___0 = isPumpRunning() [L338] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L490] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 3 error locations. UNSAFE Result, 5.7s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 829 SDtfs, 1296 SDslu, 1083 SDs, 0 SdLazy, 160 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred 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, 776 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...