./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product38.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 a0c13a298b8ef5fea6639223509104e0f4da0801 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-19 21:22:04,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:22:04,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:22:04,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:22:04,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:22:04,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:22:04,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:22:04,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:22:04,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:22:04,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:22:04,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:22:04,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:22:04,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:22:04,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:22:04,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:22:04,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:22:04,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:22:04,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:22:04,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:22:04,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:22:04,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:22:04,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:22:04,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:22:04,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:22:04,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:22:04,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:22:04,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:22:04,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:22:04,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:22:04,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:22:04,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:22:04,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:22:04,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:22:04,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:22:04,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:22:04,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:22:04,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:22:04,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:22:04,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:22:04,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:22:04,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:22:04,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:22:04,223 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:22:04,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:22:04,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:22:04,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:22:04,226 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:22:04,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:22:04,226 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:22:04,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:22:04,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:22:04,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:22:04,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:22:04,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:22:04,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:22:04,229 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:22:04,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:22:04,229 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:22:04,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:22:04,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:22:04,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:22:04,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:22:04,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:22:04,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:22:04,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:22:04,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:22:04,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:22:04,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:22:04,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:22:04,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:22:04,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0c13a298b8ef5fea6639223509104e0f4da0801 [2019-11-19 21:22:04,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:22:04,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:22:04,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:22:04,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:22:04,558 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:22:04,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c [2019-11-19 21:22:04,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcdbe71a/d4f9ed11ab924b049163c8127c301122/FLAG3ab0ff819 [2019-11-19 21:22:05,139 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:22:05,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c [2019-11-19 21:22:05,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcdbe71a/d4f9ed11ab924b049163c8127c301122/FLAG3ab0ff819 [2019-11-19 21:22:05,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcdbe71a/d4f9ed11ab924b049163c8127c301122 [2019-11-19 21:22:05,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:22:05,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:22:05,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:05,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:22:05,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:22:05,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:05" (1/1) ... [2019-11-19 21:22:05,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5834b72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:05, skipping insertion in model container [2019-11-19 21:22:05,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:05" (1/1) ... [2019-11-19 21:22:05,524 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:22:05,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:22:05,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:05,979 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:22:06,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:06,138 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:22:06,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06 WrapperNode [2019-11-19 21:22:06,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:06,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:06,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:22:06,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:22:06,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:06,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:22:06,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:22:06,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:22:06,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... [2019-11-19 21:22:06,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:22:06,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:22:06,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:22:06,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:22:06,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:22:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:22:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 21:22:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:22:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:22:07,226 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:22:07,227 INFO L285 CfgBuilder]: Removed 158 assume(true) statements. [2019-11-19 21:22:07,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:07 BoogieIcfgContainer [2019-11-19 21:22:07,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:22:07,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:22:07,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:22:07,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:22:07,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:22:05" (1/3) ... [2019-11-19 21:22:07,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637b1860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:07, skipping insertion in model container [2019-11-19 21:22:07,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:06" (2/3) ... [2019-11-19 21:22:07,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637b1860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:07, skipping insertion in model container [2019-11-19 21:22:07,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:07" (3/3) ... [2019-11-19 21:22:07,238 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product38.cil.c [2019-11-19 21:22:07,247 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:22:07,256 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 21:22:07,267 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 21:22:07,297 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:22:07,297 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:22:07,297 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:22:07,298 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:22:07,298 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:22:07,298 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:22:07,298 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:22:07,299 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:22:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-11-19 21:22:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:22:07,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:07,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:07,330 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:07,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1529342393, now seen corresponding path program 1 times [2019-11-19 21:22:07,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:07,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286849373] [2019-11-19 21:22:07,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:07,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286849373] [2019-11-19 21:22:07,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:07,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:07,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955611448] [2019-11-19 21:22:07,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:22:07,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:07,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:22:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:22:07,590 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-11-19 21:22:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:07,637 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-11-19 21:22:07,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:22:07,639 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 21:22:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:07,656 INFO L225 Difference]: With dead ends: 216 [2019-11-19 21:22:07,656 INFO L226 Difference]: Without dead ends: 107 [2019-11-19 21:22:07,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:22:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-19 21:22:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-19 21:22:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-19 21:22:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-11-19 21:22:07,709 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-11-19 21:22:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:07,710 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-11-19 21:22:07,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:22:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-11-19 21:22:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:22:07,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:07,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:07,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:07,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:07,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1945506518, now seen corresponding path program 1 times [2019-11-19 21:22:07,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:07,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676914269] [2019-11-19 21:22:07,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:07,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676914269] [2019-11-19 21:22:07,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:07,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:22:07,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123036255] [2019-11-19 21:22:07,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:07,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:07,825 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-11-19 21:22:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:07,847 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-11-19 21:22:07,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:07,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 21:22:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:07,851 INFO L225 Difference]: With dead ends: 107 [2019-11-19 21:22:07,852 INFO L226 Difference]: Without dead ends: 45 [2019-11-19 21:22:07,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:07,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-19 21:22:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-19 21:22:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 21:22:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-11-19 21:22:07,865 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-11-19 21:22:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:07,866 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-11-19 21:22:07,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-11-19 21:22:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:22:07,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:07,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:07,868 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:07,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1939738244, now seen corresponding path program 1 times [2019-11-19 21:22:07,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:07,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490961521] [2019-11-19 21:22:07,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:07,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490961521] [2019-11-19 21:22:07,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:07,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:07,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408867495] [2019-11-19 21:22:07,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:07,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:07,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:07,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:07,988 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 5 states. [2019-11-19 21:22:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:08,041 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-11-19 21:22:08,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:22:08,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-19 21:22:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:08,042 INFO L225 Difference]: With dead ends: 84 [2019-11-19 21:22:08,043 INFO L226 Difference]: Without dead ends: 45 [2019-11-19 21:22:08,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:22:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-19 21:22:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-19 21:22:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 21:22:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-11-19 21:22:08,049 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-11-19 21:22:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:08,050 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-11-19 21:22:08,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-11-19 21:22:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 21:22:08,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:08,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:08,052 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1547834963, now seen corresponding path program 1 times [2019-11-19 21:22:08,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:08,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138599055] [2019-11-19 21:22:08,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:08,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138599055] [2019-11-19 21:22:08,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:08,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:08,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319883368] [2019-11-19 21:22:08,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:08,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:08,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:08,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:08,160 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-11-19 21:22:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:08,192 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-11-19 21:22:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:08,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 21:22:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:08,194 INFO L225 Difference]: With dead ends: 105 [2019-11-19 21:22:08,194 INFO L226 Difference]: Without dead ends: 66 [2019-11-19 21:22:08,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-19 21:22:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-19 21:22:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 21:22:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-11-19 21:22:08,204 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-11-19 21:22:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:08,204 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-11-19 21:22:08,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-11-19 21:22:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:08,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:08,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:08,207 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:08,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1827782978, now seen corresponding path program 1 times [2019-11-19 21:22:08,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:08,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452923569] [2019-11-19 21:22:08,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:08,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452923569] [2019-11-19 21:22:08,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:08,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:08,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970513042] [2019-11-19 21:22:08,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:08,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:08,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:08,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:08,322 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-11-19 21:22:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:08,407 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-11-19 21:22:08,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:08,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:08,409 INFO L225 Difference]: With dead ends: 171 [2019-11-19 21:22:08,410 INFO L226 Difference]: Without dead ends: 113 [2019-11-19 21:22:08,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:22:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-19 21:22:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-11-19 21:22:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 21:22:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-11-19 21:22:08,421 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-11-19 21:22:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:08,422 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-11-19 21:22:08,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-11-19 21:22:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:08,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:08,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:08,424 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash 834728065, now seen corresponding path program 1 times [2019-11-19 21:22:08,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:08,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429679377] [2019-11-19 21:22:08,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:08,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429679377] [2019-11-19 21:22:08,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:08,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:08,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907767209] [2019-11-19 21:22:08,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:08,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:08,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:08,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:08,527 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-11-19 21:22:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:08,631 INFO L93 Difference]: Finished difference Result 344 states and 483 transitions. [2019-11-19 21:22:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 21:22:08,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:08,633 INFO L225 Difference]: With dead ends: 344 [2019-11-19 21:22:08,634 INFO L226 Difference]: Without dead ends: 280 [2019-11-19 21:22:08,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:22:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-19 21:22:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 128. [2019-11-19 21:22:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-19 21:22:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2019-11-19 21:22:08,652 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 30 [2019-11-19 21:22:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:08,652 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2019-11-19 21:22:08,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2019-11-19 21:22:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:08,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:08,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:08,654 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1506496567, now seen corresponding path program 1 times [2019-11-19 21:22:08,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:08,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455920515] [2019-11-19 21:22:08,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:08,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455920515] [2019-11-19 21:22:08,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:08,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:08,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148966045] [2019-11-19 21:22:08,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:08,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:08,725 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand 5 states. [2019-11-19 21:22:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:08,908 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2019-11-19 21:22:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:22:08,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 21:22:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:08,913 INFO L225 Difference]: With dead ends: 366 [2019-11-19 21:22:08,913 INFO L226 Difference]: Without dead ends: 364 [2019-11-19 21:22:08,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:22:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-11-19 21:22:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 128. [2019-11-19 21:22:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-19 21:22:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2019-11-19 21:22:08,942 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 31 [2019-11-19 21:22:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:08,942 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2019-11-19 21:22:08,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2019-11-19 21:22:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:08,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:08,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:08,950 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1549041486, now seen corresponding path program 1 times [2019-11-19 21:22:08,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:08,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861977438] [2019-11-19 21:22:08,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:09,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861977438] [2019-11-19 21:22:09,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:09,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:09,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384624926] [2019-11-19 21:22:09,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:22:09,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:09,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:22:09,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:22:09,012 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand 4 states. [2019-11-19 21:22:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:09,058 INFO L93 Difference]: Finished difference Result 308 states and 416 transitions. [2019-11-19 21:22:09,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:22:09,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-19 21:22:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:09,060 INFO L225 Difference]: With dead ends: 308 [2019-11-19 21:22:09,060 INFO L226 Difference]: Without dead ends: 186 [2019-11-19 21:22:09,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-19 21:22:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2019-11-19 21:22:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-19 21:22:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2019-11-19 21:22:09,074 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 31 [2019-11-19 21:22:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:09,074 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2019-11-19 21:22:09,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:22:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2019-11-19 21:22:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:09,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:09,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:09,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1290876048, now seen corresponding path program 1 times [2019-11-19 21:22:09,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:09,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835712735] [2019-11-19 21:22:09,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:22:09,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835712735] [2019-11-19 21:22:09,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:09,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:09,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355464122] [2019-11-19 21:22:09,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:09,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:09,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:09,114 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2019-11-19 21:22:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:09,149 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2019-11-19 21:22:09,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:09,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-19 21:22:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:09,151 INFO L225 Difference]: With dead ends: 316 [2019-11-19 21:22:09,151 INFO L226 Difference]: Without dead ends: 186 [2019-11-19 21:22:09,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-19 21:22:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-19 21:22:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-19 21:22:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2019-11-19 21:22:09,172 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 31 [2019-11-19 21:22:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:09,173 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2019-11-19 21:22:09,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2019-11-19 21:22:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 21:22:09,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:09,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:09,175 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 891331378, now seen corresponding path program 1 times [2019-11-19 21:22:09,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:09,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964323747] [2019-11-19 21:22:09,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:09,317 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:22:09,317 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:22:09,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:22:09 BoogieIcfgContainer [2019-11-19 21:22:09,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:22:09,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:22:09,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:22:09,471 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:22:09,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:07" (3/4) ... [2019-11-19 21:22:09,474 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:22:09,560 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:22:09,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:22:09,562 INFO L168 Benchmark]: Toolchain (without parser) took 4054.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -222.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:09,563 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:09,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:09,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:09,564 INFO L168 Benchmark]: Boogie Preprocessor took 45.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:09,565 INFO L168 Benchmark]: RCFGBuilder took 953.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:09,565 INFO L168 Benchmark]: TraceAbstraction took 2240.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -155.8 MB). Peak memory consumption was 239.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:09,566 INFO L168 Benchmark]: Witness Printer took 89.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:09,568 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 953.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2240.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -155.8 MB). Peak memory consumption was 239.4 MB. Max. memory is 11.5 GB. * Witness Printer took 89.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 837]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L377] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L580] int pumpRunning = 0; [L581] int systemActive = 1; [L843] int waterLevel = 1; [L844] int methaneLevelCritical = 0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L170] int retValue_acc ; [L173] retValue_acc = 1 [L174] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L767] int splverifierCounter ; [L768] int tmp ; [L769] int tmp___0 ; [L770] int tmp___1 ; [L771] int tmp___2 ; [L774] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L784] tmp = __VERIFIER_nondet_int() [L786] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L861] COND TRUE waterLevel < 2 [L862] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L794] tmp___0 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L873] COND FALSE !(\read(methaneLevelCritical)) [L876] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] tmp___2 = __VERIFIER_nondet_int() [L806] COND TRUE \read(tmp___2) [L761] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L587] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE \read(systemActive) [L642] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L645] COND FALSE !(\read(pumpRunning)) [L616] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L619] COND TRUE ! pumpRunning [L739] int retValue_acc ; [L740] int tmp ; [L741] int tmp___0 ; [L923] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L926] COND FALSE !(waterLevel < 2) [L930] retValue_acc = 0 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L745] tmp = isHighWaterSensorDry() [L747] COND FALSE !(\read(tmp)) [L750] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L752] retValue_acc = tmp___0 [L753] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L621] tmp = isHighWaterLevel() [L623] COND TRUE \read(tmp) [L670] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L183] int tmp ; [L184] int tmp___0 ; [L882] int retValue_acc ; [L885] retValue_acc = methaneLevelCritical [L886] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L188] tmp = isMethaneLevelCritical() [L190] COND TRUE \read(tmp) [L694] int retValue_acc ; [L697] retValue_acc = pumpRunning [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L192] tmp___0 = isPumpRunning() [L194] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L837] __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, 111 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 785 SDtfs, 952 SDslu, 964 SDs, 0 SdLazy, 149 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 483 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 11571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...