./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product34_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_product34_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 45e9be5ff3d2c5f3e04037cd81f89ba3fcf7e541 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:40:49,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:40:49,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:40:49,235 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:40:49,235 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:40:49,236 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:40:49,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:40:49,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:40:49,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:40:49,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:40:49,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:40:49,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:40:49,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:40:49,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:40:49,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:40:49,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:40:49,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:40:49,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:40:49,253 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:40:49,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:40:49,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:40:49,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:40:49,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:40:49,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:40:49,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:40:49,262 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:40:49,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:40:49,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:40:49,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:40:49,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:40:49,267 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:40:49,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:40:49,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:40:49,268 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:40:49,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:40:49,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:40:49,270 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:40:49,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:40:49,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:40:49,288 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:40:49,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:40:49,289 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:40:49,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:40:49,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:40:49,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:40:49,290 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:40:49,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:40:49,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:40:49,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:40:49,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:40:49,291 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:40:49,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:40:49,292 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:40:49,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:40:49,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:40:49,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:40:49,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:40:49,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:40:49,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:40:49,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:40:49,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:40:49,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:40:49,294 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:40:49,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:40:49,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:40:49,296 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 -> 45e9be5ff3d2c5f3e04037cd81f89ba3fcf7e541 [2018-12-31 09:40:49,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:40:49,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:40:49,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:40:49,354 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:40:49,355 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:40:49,355 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product34_false-unreach-call_false-termination.cil.c [2018-12-31 09:40:49,411 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a18e99c/bab98545353c4156bbff25e847cf54c4/FLAG5f5e0666c [2018-12-31 09:40:49,999 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:40:50,002 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product34_false-unreach-call_false-termination.cil.c [2018-12-31 09:40:50,029 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a18e99c/bab98545353c4156bbff25e847cf54c4/FLAG5f5e0666c [2018-12-31 09:40:50,220 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a18e99c/bab98545353c4156bbff25e847cf54c4 [2018-12-31 09:40:50,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:40:50,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:40:50,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:40:50,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:40:50,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:40:50,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:50,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22099427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50, skipping insertion in model container [2018-12-31 09:40:50,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:50,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:40:50,319 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:40:50,675 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:40:50,691 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:40:50,773 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:40:50,808 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:40:50,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50 WrapperNode [2018-12-31 09:40:50,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:40:50,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:40:50,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:40:50,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:40:50,892 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:40:50" (1/1) ... [2018-12-31 09:40:50,916 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:40:50" (1/1) ... [2018-12-31 09:40:50,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:40:50,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:40:50,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:40:50,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:40:50,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:50,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:50,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:50,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:50,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:51,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:51,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (1/1) ... [2018-12-31 09:40:51,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:40:51,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:40:51,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:40:51,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:40:51,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (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:40:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:40:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:40:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:40:51,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:40:52,218 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:40:52,219 INFO L280 CfgBuilder]: Removed 98 assue(true) statements. [2018-12-31 09:40:52,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:40:52 BoogieIcfgContainer [2018-12-31 09:40:52,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:40:52,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:40:52,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:40:52,224 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:40:52,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:40:50" (1/3) ... [2018-12-31 09:40:52,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ff194b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:40:52, skipping insertion in model container [2018-12-31 09:40:52,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:50" (2/3) ... [2018-12-31 09:40:52,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ff194b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:40:52, skipping insertion in model container [2018-12-31 09:40:52,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:40:52" (3/3) ... [2018-12-31 09:40:52,227 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product34_false-unreach-call_false-termination.cil.c [2018-12-31 09:40:52,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:40:52,246 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:40:52,263 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:40:52,305 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:40:52,305 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:40:52,306 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:40:52,306 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:40:52,306 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:40:52,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:40:52,306 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:40:52,306 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:40:52,307 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:40:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-12-31 09:40:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:40:52,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:52,333 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:40:52,335 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1424204181, now seen corresponding path program 1 times [2018-12-31 09:40:52,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:52,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:52,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:52,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:52,588 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:40:52,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:52,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:40:52,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:40:52,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:40:52,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:40:52,616 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-12-31 09:40:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:52,647 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2018-12-31 09:40:52,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:40:52,650 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:40:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:52,663 INFO L225 Difference]: With dead ends: 150 [2018-12-31 09:40:52,663 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 09:40:52,666 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:40:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 09:40:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-31 09:40:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 09:40:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2018-12-31 09:40:52,708 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2018-12-31 09:40:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:52,709 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2018-12-31 09:40:52,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:40:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2018-12-31 09:40:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:40:52,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:52,710 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:40:52,711 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash -631654862, now seen corresponding path program 1 times [2018-12-31 09:40:52,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:52,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:52,843 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:40:52,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:52,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:40:52,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:40:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:40:52,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:40:52,849 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2018-12-31 09:40:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:52,890 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2018-12-31 09:40:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:40:52,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:40:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:52,892 INFO L225 Difference]: With dead ends: 74 [2018-12-31 09:40:52,892 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:40:52,896 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:40:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:40:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-31 09:40:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 09:40:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2018-12-31 09:40:52,907 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2018-12-31 09:40:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:52,908 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2018-12-31 09:40:52,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:40:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2018-12-31 09:40:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:40:52,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:52,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:40:52,912 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash -964945646, now seen corresponding path program 1 times [2018-12-31 09:40:52,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:52,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:52,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:53,118 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:40:53,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:53,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:40:53,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:40:53,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:40:53,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:53,123 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2018-12-31 09:40:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:53,233 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2018-12-31 09:40:53,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:40:53,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 09:40:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:53,234 INFO L225 Difference]: With dead ends: 62 [2018-12-31 09:40:53,234 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:40:53,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:40:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:40:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-31 09:40:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 09:40:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2018-12-31 09:40:53,241 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2018-12-31 09:40:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:53,242 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2018-12-31 09:40:53,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:40:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2018-12-31 09:40:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:40:53,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:53,243 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] [2018-12-31 09:40:53,244 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash -952202930, now seen corresponding path program 1 times [2018-12-31 09:40:53,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:53,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:53,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:53,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:53,352 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:40:53,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:53,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:40:53,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:40:53,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:40:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:40:53,354 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2018-12-31 09:40:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:53,443 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2018-12-31 09:40:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:40:53,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 09:40:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:53,445 INFO L225 Difference]: With dead ends: 83 [2018-12-31 09:40:53,445 INFO L226 Difference]: Without dead ends: 55 [2018-12-31 09:40:53,446 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:40:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-31 09:40:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-12-31 09:40:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 09:40:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2018-12-31 09:40:53,457 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2018-12-31 09:40:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:53,457 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2018-12-31 09:40:53,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:40:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2018-12-31 09:40:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 09:40:53,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:53,459 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] [2018-12-31 09:40:53,459 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2049720417, now seen corresponding path program 1 times [2018-12-31 09:40:53,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:53,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:53,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:53,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:53,614 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:40:53,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:53,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:40:53,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:40:53,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:40:53,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:53,616 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2018-12-31 09:40:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:53,807 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2018-12-31 09:40:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:40:53,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-31 09:40:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:53,810 INFO L225 Difference]: With dead ends: 139 [2018-12-31 09:40:53,810 INFO L226 Difference]: Without dead ends: 92 [2018-12-31 09:40:53,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:40:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-31 09:40:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2018-12-31 09:40:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 09:40:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2018-12-31 09:40:53,840 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2018-12-31 09:40:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:53,840 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2018-12-31 09:40:53,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:40:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2018-12-31 09:40:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 09:40:53,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:53,842 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] [2018-12-31 09:40:53,846 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash 612790626, now seen corresponding path program 1 times [2018-12-31 09:40:53,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:53,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:53,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:54,147 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:40:54,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:54,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:40:54,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:40:54,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:40:54,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:54,150 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2018-12-31 09:40:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:54,623 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2018-12-31 09:40:54,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:40:54,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-31 09:40:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:54,632 INFO L225 Difference]: With dead ends: 270 [2018-12-31 09:40:54,632 INFO L226 Difference]: Without dead ends: 220 [2018-12-31 09:40:54,633 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:40:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-31 09:40:54,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 100. [2018-12-31 09:40:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-31 09:40:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2018-12-31 09:40:54,654 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 29 [2018-12-31 09:40:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:54,655 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2018-12-31 09:40:54,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:40:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2018-12-31 09:40:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:40:54,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:54,657 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] [2018-12-31 09:40:54,657 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1166654740, now seen corresponding path program 1 times [2018-12-31 09:40:54,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:54,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:54,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:54,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:54,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:54,869 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:40:54,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:54,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:40:54,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:40:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:40:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:54,872 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 5 states. [2018-12-31 09:40:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:55,657 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2018-12-31 09:40:55,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:40:55,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:40:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:55,666 INFO L225 Difference]: With dead ends: 280 [2018-12-31 09:40:55,669 INFO L226 Difference]: Without dead ends: 278 [2018-12-31 09:40:55,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:40:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-31 09:40:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2018-12-31 09:40:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-31 09:40:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2018-12-31 09:40:55,716 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 30 [2018-12-31 09:40:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:55,716 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2018-12-31 09:40:55,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:40:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2018-12-31 09:40:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:40:55,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:55,721 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] [2018-12-31 09:40:55,722 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:55,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash 72774503, now seen corresponding path program 1 times [2018-12-31 09:40:55,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:55,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:55,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:55,842 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:40:55,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:55,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:40:55,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:40:55,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:40:55,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:40:55,845 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 4 states. [2018-12-31 09:40:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:56,112 INFO L93 Difference]: Finished difference Result 240 states and 326 transitions. [2018-12-31 09:40:56,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:40:56,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-31 09:40:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:56,114 INFO L225 Difference]: With dead ends: 240 [2018-12-31 09:40:56,116 INFO L226 Difference]: Without dead ends: 146 [2018-12-31 09:40:56,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-31 09:40:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-12-31 09:40:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 09:40:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2018-12-31 09:40:56,149 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 30 [2018-12-31 09:40:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:56,150 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2018-12-31 09:40:56,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:40:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2018-12-31 09:40:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:40:56,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:56,154 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] [2018-12-31 09:40:56,155 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash 330939941, now seen corresponding path program 1 times [2018-12-31 09:40:56,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:56,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:56,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:56,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:56,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:56,236 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:40:56,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:56,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:40:56,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:40:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:40:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:40:56,237 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand 3 states. [2018-12-31 09:40:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:56,382 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2018-12-31 09:40:56,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:40:56,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-31 09:40:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:56,385 INFO L225 Difference]: With dead ends: 250 [2018-12-31 09:40:56,385 INFO L226 Difference]: Without dead ends: 152 [2018-12-31 09:40:56,387 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:40:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-31 09:40:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-31 09:40:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-31 09:40:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2018-12-31 09:40:56,418 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2018-12-31 09:40:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:56,418 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2018-12-31 09:40:56,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:40:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-12-31 09:40:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:40:56,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:56,421 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:40:56,422 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1676876253, now seen corresponding path program 1 times [2018-12-31 09:40:56,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:56,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:56,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:40:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:40:57,525 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:40:57,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:40:57 BoogieIcfgContainer [2018-12-31 09:40:57,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:40:57,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:40:57,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:40:57,661 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:40:57,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:40:52" (3/4) ... [2018-12-31 09:40:57,665 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:40:57,788 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:40:57,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:40:57,789 INFO L168 Benchmark]: Toolchain (without parser) took 7564.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:57,793 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:40:57,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:57,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 919.2 MB in the beginning and 1.1 GB in the end (delta: -202.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:57,796 INFO L168 Benchmark]: Boogie Preprocessor took 42.74 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. [2018-12-31 09:40:57,796 INFO L168 Benchmark]: RCFGBuilder took 1210.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:57,797 INFO L168 Benchmark]: TraceAbstraction took 5440.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.2 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:57,797 INFO L168 Benchmark]: Witness Printer took 127.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:57,807 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 155.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 919.2 MB in the beginning and 1.1 GB in the end (delta: -202.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.74 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 1210.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5440.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.2 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * Witness Printer took 127.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 514]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L313] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L524] int waterLevel = 1; [L525] int methaneLevelCritical = 0; [L689] int pumpRunning = 0; [L690] int systemActive = 1; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L902] int retValue_acc ; [L905] retValue_acc = 1 [L906] 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] [L620] int splverifierCounter ; [L621] int tmp ; [L622] int tmp___0 ; [L623] int tmp___1 ; [L624] int tmp___2 ; [L627] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L629] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L631] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L637] tmp = __VERIFIER_nondet_int() [L639] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L542] COND TRUE waterLevel < 2 [L543] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L647] tmp___0 = __VERIFIER_nondet_int() [L649] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L554] COND FALSE !(\read(methaneLevelCritical)) [L557] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L657] tmp___2 = __VERIFIER_nondet_int() [L659] COND TRUE \read(tmp___2) [L845] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L697] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L704] COND TRUE \read(systemActive) [L726] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L729] COND TRUE ! pumpRunning [L823] int retValue_acc ; [L824] int tmp ; [L825] int tmp___0 ; [L604] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L607] COND FALSE !(waterLevel < 2) [L611] retValue_acc = 0 [L612] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L829] tmp = isHighWaterSensorDry() [L831] COND FALSE !(\read(tmp)) [L834] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L836] retValue_acc = tmp___0 [L837] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L731] tmp = isHighWaterLevel() [L733] COND TRUE \read(tmp) [L754] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L851] int tmp ; [L852] int tmp___0 ; [L563] int retValue_acc ; [L566] retValue_acc = methaneLevelCritical [L567] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L856] tmp = isMethaneLevelCritical() [L858] COND TRUE \read(tmp) [L778] int retValue_acc ; [L781] retValue_acc = pumpRunning [L782] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L860] tmp___0 = isPumpRunning() [L862] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L514] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 3 error locations. UNSAFE Result, 5.3s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 577 SDtfs, 722 SDslu, 756 SDs, 0 SdLazy, 101 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 378 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 10827 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...