java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ldv-regression/stateful_check.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:02:27,337 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:02:27,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:02:27,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:02:27,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:02:27,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:02:27,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:02:27,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:02:27,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:02:27,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:02:27,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:02:27,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:02:27,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:02:27,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:02:27,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:02:27,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:02:27,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:02:27,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:02:27,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:02:27,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:02:27,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:02:27,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:02:27,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:02:27,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:02:27,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:02:27,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:02:27,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:02:27,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:02:27,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:02:27,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:02:27,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:02:27,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:02:27,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:02:27,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:02:27,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:02:27,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:02:27,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:02:27,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:02:27,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:02:27,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:02:27,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:02:27,424 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-10-13 21:02:27,457 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 21:02:27,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:02:27,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:02:27,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 21:02:27,459 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 21:02:27,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:02:27,460 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 21:02:27,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 21:02:27,463 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 21:02:27,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 21:02:27,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:02:27,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:02:27,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:02:27,464 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 21:02:27,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 21:02:27,466 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 21:02:27,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:02:27,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:02:27,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 21:02:27,467 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 21:02:27,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 21:02:27,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:02:27,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:02:27,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:02:27,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:02:27,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 21:02:27,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:02:27,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:02:27,469 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES
[2019-10-13 21:02:27,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:02:27,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:02:27,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:02:27,781 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 21:02:27,781 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 21:02:27,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/stateful_check.c
[2019-10-13 21:02:27,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9642f58/6fa7fc8319b841fe9cf456658242c1bd/FLAG9e648fde0
[2019-10-13 21:02:28,337 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 21:02:28,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/stateful_check.c
[2019-10-13 21:02:28,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9642f58/6fa7fc8319b841fe9cf456658242c1bd/FLAG9e648fde0
[2019-10-13 21:02:28,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9642f58/6fa7fc8319b841fe9cf456658242c1bd
[2019-10-13 21:02:28,684 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:02:28,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:02:28,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:02:28,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:02:28,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:02:28,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:28,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d0143d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28, skipping insertion in model container
[2019-10-13 21:02:28,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:28,703 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 21:02:28,731 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:02:28,930 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:02:28,944 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 21:02:28,979 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:02:28,995 INFO L192 MainTranslator]: Completed translation
[2019-10-13 21:02:28,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28 WrapperNode
[2019-10-13 21:02:28,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:02:28,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:02:28,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:02:28,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:02:29,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:29,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:29,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:29,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:29,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:29,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:29,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (1/1) ...
[2019-10-13 21:02:29,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:02:29,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:02:29,127 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:02:29,127 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:02:29,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (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-10-13 21:02:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:02:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:02:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert
[2019-10-13 21:02:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock
[2019-10-13 21:02:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock
[2019-10-13 21:02:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure check_final_state
[2019-10-13 21:02:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_release
[2019-10-13 21:02:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_llseek
[2019-10-13 21:02:29,179 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_read
[2019-10-13 21:02:29,179 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_open
[2019-10-13 21:02:29,179 INFO L138 BoogieDeclarations]: Found implementation of procedure my_init
[2019-10-13 21:02:29,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:02:29,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:02:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert
[2019-10-13 21:02:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 21:02:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock
[2019-10-13 21:02:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock
[2019-10-13 21:02:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure check_final_state
[2019-10-13 21:02:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure misc_release
[2019-10-13 21:02:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure misc_llseek
[2019-10-13 21:02:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure misc_read
[2019-10-13 21:02:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure misc_open
[2019-10-13 21:02:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure my_init
[2019-10-13 21:02:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:02:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:02:29,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:02:29,519 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:02:29,519 INFO L284 CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-13 21:02:29,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:02:29 BoogieIcfgContainer
[2019-10-13 21:02:29,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:02:29,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:02:29,522 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:02:29,525 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:02:29,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:02:28" (1/3) ...
[2019-10-13 21:02:29,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91b41f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:02:29, skipping insertion in model container
[2019-10-13 21:02:29,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:28" (2/3) ...
[2019-10-13 21:02:29,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91b41f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:02:29, skipping insertion in model container
[2019-10-13 21:02:29,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:02:29" (3/3) ...
[2019-10-13 21:02:29,528 INFO L109 eAbstractionObserver]: Analyzing ICFG stateful_check.c
[2019-10-13 21:02:29,539 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:02:29,546 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 21:02:29,557 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 21:02:29,586 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:02:29,586 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 21:02:29,586 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:02:29,586 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:02:29,587 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:02:29,587 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 21:02:29,587 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:02:29,587 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:02:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states.
[2019-10-13 21:02:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 21:02:29,616 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:02:29,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:02:29,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:02:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1865767033, now seen corresponding path program 1 times
[2019-10-13 21:02:29,636 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:02:29,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805196758]
[2019-10-13 21:02:29,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:29,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:29,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:02:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:29,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805196758]
[2019-10-13 21:02:29,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:02:29,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-10-13 21:02:29,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653175128]
[2019-10-13 21:02:29,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-10-13 21:02:29,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:02:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-10-13 21:02:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 21:02:29,768 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states.
[2019-10-13 21:02:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:02:29,800 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions.
[2019-10-13 21:02:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2019-10-13 21:02:29,802 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16
[2019-10-13 21:02:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:02:29,812 INFO L225 Difference]: With dead ends: 135
[2019-10-13 21:02:29,812 INFO L226 Difference]: Without dead ends: 65
[2019-10-13 21:02:29,816 INFO L600 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-10-13 21:02:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2019-10-13 21:02:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2019-10-13 21:02:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2019-10-13 21:02:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions.
[2019-10-13 21:02:29,862 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 16
[2019-10-13 21:02:29,863 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:02:29,863 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions.
[2019-10-13 21:02:29,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-10-13 21:02:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions.
[2019-10-13 21:02:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 21:02:29,864 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:02:29,864 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:02:29,865 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:02:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash 6927045, now seen corresponding path program 1 times
[2019-10-13 21:02:29,866 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:02:29,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436786365]
[2019-10-13 21:02:29,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:29,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:29,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:02:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:29,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436786365]
[2019-10-13 21:02:29,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:02:29,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:02:29,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995479787]
[2019-10-13 21:02:29,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:02:29,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:02:29,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:02:29,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:02:29,932 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 3 states.
[2019-10-13 21:02:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:02:30,009 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions.
[2019-10-13 21:02:30,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:02:30,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2019-10-13 21:02:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:02:30,014 INFO L225 Difference]: With dead ends: 108
[2019-10-13 21:02:30,014 INFO L226 Difference]: Without dead ends: 102
[2019-10-13 21:02:30,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-13 21:02:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2019-10-13 21:02:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2019-10-13 21:02:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states.
[2019-10-13 21:02:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions.
[2019-10-13 21:02:30,048 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 17
[2019-10-13 21:02:30,048 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:02:30,048 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions.
[2019-10-13 21:02:30,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:02:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions.
[2019-10-13 21:02:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2019-10-13 21:02:30,050 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:02:30,051 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:02:30,051 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:02:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash -695621135, now seen corresponding path program 1 times
[2019-10-13 21:02:30,052 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:02:30,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047545973]
[2019-10-13 21:02:30,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:30,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:30,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:02:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:30,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047545973]
[2019-10-13 21:02:30,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:02:30,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:02:30,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522039822]
[2019-10-13 21:02:30,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:02:30,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:02:30,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:02:30,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:02:30,121 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand 3 states.
[2019-10-13 21:02:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:02:30,192 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions.
[2019-10-13 21:02:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:02:30,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29
[2019-10-13 21:02:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:02:30,195 INFO L225 Difference]: With dead ends: 218
[2019-10-13 21:02:30,196 INFO L226 Difference]: Without dead ends: 127
[2019-10-13 21:02:30,197 INFO L600 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-10-13 21:02:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2019-10-13 21:02:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126.
[2019-10-13 21:02:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2019-10-13 21:02:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 169 transitions.
[2019-10-13 21:02:30,217 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 169 transitions. Word has length 29
[2019-10-13 21:02:30,218 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:02:30,218 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 169 transitions.
[2019-10-13 21:02:30,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:02:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 169 transitions.
[2019-10-13 21:02:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2019-10-13 21:02:30,220 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:02:30,220 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:02:30,221 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:02:30,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1328709660, now seen corresponding path program 1 times
[2019-10-13 21:02:30,221 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:02:30,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678184785]
[2019-10-13 21:02:30,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:30,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:30,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:02:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:30,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678184785]
[2019-10-13 21:02:30,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36152500]
[2019-10-13 21:02:30,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:02:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:30,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-10-13 21:02:30,405 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:02:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:30,436 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:02:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:30,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1665808266]
[2019-10-13 21:02:30,493 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 41
[2019-10-13 21:02:30,538 INFO L148 AbstractInterpreter]: Using domain IntervalDomain
[2019-10-13 21:02:30,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-13 21:02:30,656 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2019-10-13 21:02:30,659 INFO L272 AbstractInterpreter]: Visited 27 different actions 36 times. Merged at 8 different actions 8 times. Never widened. Performed 69 root evaluator evaluations with a maximum evaluation depth of 5. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 11 variables.
[2019-10-13 21:02:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:30,664 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-13 21:02:30,748 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 46.98% of their original sizes.
[2019-10-13 21:02:30,749 INFO L551 sIntCurrentIteration]: Unifying AI predicates
[2019-10-13 21:02:30,917 INFO L553 sIntCurrentIteration]: We unified 39 AI predicates to 39
[2019-10-13 21:02:30,918 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-13 21:02:30,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences.
[2019-10-13 21:02:30,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 4, 4] total 19
[2019-10-13 21:02:30,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882362247]
[2019-10-13 21:02:30,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states
[2019-10-13 21:02:30,923 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:02:30,923 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy
[2019-10-13 21:02:30,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2019-10-13 21:02:30,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210
[2019-10-13 21:02:30,924 INFO L87 Difference]: Start difference. First operand 126 states and 169 transitions. Second operand 15 states.
[2019-10-13 21:02:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:02:32,350 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions.
[2019-10-13 21:02:32,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2019-10-13 21:02:32,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40
[2019-10-13 21:02:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:02:32,353 INFO L225 Difference]: With dead ends: 291
[2019-10-13 21:02:32,354 INFO L226 Difference]: Without dead ends: 176
[2019-10-13 21:02:32,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380
[2019-10-13 21:02:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2019-10-13 21:02:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168.
[2019-10-13 21:02:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states.
[2019-10-13 21:02:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 227 transitions.
[2019-10-13 21:02:32,377 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 227 transitions. Word has length 40
[2019-10-13 21:02:32,377 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:02:32,377 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 227 transitions.
[2019-10-13 21:02:32,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2019-10-13 21:02:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 227 transitions.
[2019-10-13 21:02:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2019-10-13 21:02:32,380 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:02:32,380 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:02:32,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:02:32,598 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:02:32,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:32,598 INFO L82 PathProgramCache]: Analyzing trace with hash -83945179, now seen corresponding path program 1 times
[2019-10-13 21:02:32,599 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:02:32,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794152196]
[2019-10-13 21:02:32,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:32,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:32,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:02:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:32,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794152196]
[2019-10-13 21:02:32,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793664728]
[2019-10-13 21:02:32,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:02:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:32,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-10-13 21:02:32,732 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:02:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:32,740 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:02:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:02:32,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [373178513]
[2019-10-13 21:02:32,797 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 41
[2019-10-13 21:02:32,800 INFO L148 AbstractInterpreter]: Using domain IntervalDomain
[2019-10-13 21:02:32,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-13 21:02:32,810 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2019-10-13 21:02:32,811 INFO L272 AbstractInterpreter]: Visited 27 different actions 36 times. Merged at 8 different actions 8 times. Never widened. Performed 69 root evaluator evaluations with a maximum evaluation depth of 5. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 11 variables.
[2019-10-13 21:02:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:32,811 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-13 21:02:32,832 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 53.78% of their original sizes.
[2019-10-13 21:02:32,832 INFO L551 sIntCurrentIteration]: Unifying AI predicates
[2019-10-13 21:02:32,954 INFO L553 sIntCurrentIteration]: We unified 39 AI predicates to 39
[2019-10-13 21:02:32,955 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-13 21:02:32,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences.
[2019-10-13 21:02:32,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 4, 4] total 19
[2019-10-13 21:02:32,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828675754]
[2019-10-13 21:02:32,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states
[2019-10-13 21:02:32,956 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:02:32,956 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy
[2019-10-13 21:02:32,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2019-10-13 21:02:32,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210
[2019-10-13 21:02:32,957 INFO L87 Difference]: Start difference. First operand 168 states and 227 transitions. Second operand 15 states.
[2019-10-13 21:02:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:02:33,755 INFO L93 Difference]: Finished difference Result 367 states and 513 transitions.
[2019-10-13 21:02:33,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2019-10-13 21:02:33,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40
[2019-10-13 21:02:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:02:33,758 INFO L225 Difference]: With dead ends: 367
[2019-10-13 21:02:33,758 INFO L226 Difference]: Without dead ends: 210
[2019-10-13 21:02:33,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306
[2019-10-13 21:02:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2019-10-13 21:02:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207.
[2019-10-13 21:02:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states.
[2019-10-13 21:02:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 283 transitions.
[2019-10-13 21:02:33,779 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 283 transitions. Word has length 40
[2019-10-13 21:02:33,779 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:02:33,779 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 283 transitions.
[2019-10-13 21:02:33,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2019-10-13 21:02:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 283 transitions.
[2019-10-13 21:02:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2019-10-13 21:02:33,782 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:02:33,782 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:02:33,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:02:33,989 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:02:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:33,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1902321111, now seen corresponding path program 1 times
[2019-10-13 21:02:33,990 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:02:33,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41814095]
[2019-10-13 21:02:33,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:33,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:33,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:02:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2019-10-13 21:02:34,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41814095]
[2019-10-13 21:02:34,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:02:34,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:02:34,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49480289]
[2019-10-13 21:02:34,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:02:34,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:02:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:02:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:02:34,075 INFO L87 Difference]: Start difference. First operand 207 states and 283 transitions. Second operand 4 states.
[2019-10-13 21:02:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:02:34,135 INFO L93 Difference]: Finished difference Result 525 states and 755 transitions.
[2019-10-13 21:02:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 21:02:34,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51
[2019-10-13 21:02:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:02:34,141 INFO L225 Difference]: With dead ends: 525
[2019-10-13 21:02:34,141 INFO L226 Difference]: Without dead ends: 329
[2019-10-13 21:02:34,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:02:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states.
[2019-10-13 21:02:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 279.
[2019-10-13 21:02:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states.
[2019-10-13 21:02:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 402 transitions.
[2019-10-13 21:02:34,180 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 402 transitions. Word has length 51
[2019-10-13 21:02:34,181 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:02:34,181 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 402 transitions.
[2019-10-13 21:02:34,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:02:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 402 transitions.
[2019-10-13 21:02:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2019-10-13 21:02:34,190 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:02:34,194 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:02:34,194 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:02:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:34,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1918799396, now seen corresponding path program 1 times
[2019-10-13 21:02:34,195 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:02:34,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233093933]
[2019-10-13 21:02:34,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:34,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:34,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:02:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:02:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2019-10-13 21:02:34,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233093933]
[2019-10-13 21:02:34,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:02:34,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:02:34,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865634708]
[2019-10-13 21:02:34,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:02:34,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:02:34,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:02:34,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:02:34,343 INFO L87 Difference]: Start difference. First operand 279 states and 402 transitions. Second operand 3 states.
[2019-10-13 21:02:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:02:34,375 INFO L93 Difference]: Finished difference Result 612 states and 889 transitions.
[2019-10-13 21:02:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:02:34,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63
[2019-10-13 21:02:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:02:34,378 INFO L225 Difference]: With dead ends: 612
[2019-10-13 21:02:34,379 INFO L226 Difference]: Without dead ends: 344
[2019-10-13 21:02:34,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-13 21:02:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states.
[2019-10-13 21:02:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 338.
[2019-10-13 21:02:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states.
[2019-10-13 21:02:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 489 transitions.
[2019-10-13 21:02:34,407 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 489 transitions. Word has length 63
[2019-10-13 21:02:34,407 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:02:34,408 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 489 transitions.
[2019-10-13 21:02:34,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:02:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 489 transitions.
[2019-10-13 21:02:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2019-10-13 21:02:34,409 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:02:34,409 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:02:34,409 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:02:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:02:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1192820603, now seen corresponding path program 1 times
[2019-10-13 21:02:34,410 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:02:34,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586677019]
[2019-10-13 21:02:34,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:34,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:02:34,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:02:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-10-13 21:02:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-10-13 21:02:34,531 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace
[2019-10-13 21:02:34,531 INFO L445 BasicCegarLoop]: Counterexample might be feasible
[2019-10-13 21:02:34,557 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,558 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,559 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,559 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,559 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,560 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,560 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,561 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,561 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,562 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,562 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,563 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,563 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,563 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
[2019-10-13 21:02:34,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:02:34 BoogieIcfgContainer
[2019-10-13 21:02:34,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:02:34,579 INFO L168 Benchmark]: Toolchain (without parser) took 5892.61 ms. Allocated memory was 137.9 MB in the beginning and 276.8 MB in the end (delta: 138.9 MB). Free memory was 101.9 MB in the beginning and 220.2 MB in the end (delta: -118.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB.
[2019-10-13 21:02:34,580 INFO L168 Benchmark]: CDTParser took 1.14 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 21:02:34,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.83 ms. Allocated memory is still 137.9 MB. Free memory was 101.7 MB in the beginning and 91.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB.
[2019-10-13 21:02:34,582 INFO L168 Benchmark]: Boogie Preprocessor took 130.16 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.4 MB in the beginning and 180.2 MB in the end (delta: -88.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB.
[2019-10-13 21:02:34,583 INFO L168 Benchmark]: RCFGBuilder took 393.88 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 160.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB.
[2019-10-13 21:02:34,584 INFO L168 Benchmark]: TraceAbstraction took 5055.11 ms. Allocated memory was 201.9 MB in the beginning and 276.8 MB in the end (delta: 75.0 MB). Free memory was 160.7 MB in the beginning and 220.2 MB in the end (delta: -59.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB.
[2019-10-13 21:02:34,588 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 1.14 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 308.83 ms. Allocated memory is still 137.9 MB. Free memory was 101.7 MB in the beginning and 91.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 130.16 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.4 MB in the beginning and 180.2 MB in the end (delta: -88.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 393.88 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 160.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 5055.11 ms. Allocated memory was 201.9 MB in the beginning and 276.8 MB in the end (delta: 75.0 MB). Free memory was 160.7 MB in the beginning and 220.2 MB in the end (delta: -59.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L9] int ldv_mutex = 1;
[L11] int open_called = 0;
VAL [\old(ldv_mutex)=4, \old(open_called)=3, ldv_mutex=1, open_called=0]
[L74] int ldv_s_misc_fops_file_operations = 0;
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, open_called=0]
[L75] CALL my_init()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0]
[L69] open_called = 0
[L70] return 0;
VAL [\old(ldv_mutex)=1, \old(open_called)=0, \result=0, ldv_mutex=1, open_called=0]
[L75] RET my_init()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, my_init()=0, open_called=0]
[L76] COND TRUE __VERIFIER_nondet_int()
[L80] case 0:
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, open_called=0]
[L81] COND TRUE ldv_s_misc_fops_file_operations==0
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, open_called=0]
[L82] CALL misc_open()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0]
[L57] COND TRUE __VERIFIER_nondet_int()
[L59] return 1;
VAL [\old(ldv_mutex)=1, \old(open_called)=0, \result=1, ldv_mutex=1, open_called=0]
[L82] RET misc_open()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, misc_open()=1, open_called=0]
[L83] ldv_s_misc_fops_file_operations++
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=1, open_called=0]
[L76] COND TRUE __VERIFIER_nondet_int()
[L80] case 0:
[L88] case 1:
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=1, ldv_mutex=1, ldv_s_misc_fops_file_operations=1, open_called=0]
[L89] COND TRUE ldv_s_misc_fops_file_operations==1
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=1, ldv_mutex=1, ldv_s_misc_fops_file_operations=1, open_called=0]
[L90] CALL misc_read()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0]
[L52] return 0;
VAL [\old(ldv_mutex)=1, \old(open_called)=0, \result=0, ldv_mutex=1, open_called=0]
[L90] RET misc_read()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=1, ldv_mutex=1, ldv_s_misc_fops_file_operations=1, misc_read()=0, open_called=0]
[L91] ldv_s_misc_fops_file_operations++
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=1, ldv_mutex=1, ldv_s_misc_fops_file_operations=2, open_called=0]
[L76] COND TRUE __VERIFIER_nondet_int()
[L80] case 0:
[L88] case 1:
[L96] case 2:
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=2, ldv_mutex=1, ldv_s_misc_fops_file_operations=2, open_called=0]
[L97] COND TRUE ldv_s_misc_fops_file_operations==2
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=2, ldv_mutex=1, ldv_s_misc_fops_file_operations=2, open_called=0]
[L98] CALL misc_llseek()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0]
[L48] return 0;
VAL [\old(ldv_mutex)=1, \old(open_called)=0, \result=0, ldv_mutex=1, open_called=0]
[L98] RET misc_llseek()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=2, ldv_mutex=1, ldv_s_misc_fops_file_operations=2, misc_llseek()=0, open_called=0]
[L99] ldv_s_misc_fops_file_operations++
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=2, ldv_mutex=1, ldv_s_misc_fops_file_operations=3, open_called=0]
[L76] COND TRUE __VERIFIER_nondet_int()
[L80] case 0:
[L88] case 1:
[L96] case 2:
[L104] case 3:
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=3, ldv_mutex=1, ldv_s_misc_fops_file_operations=3, open_called=0]
[L105] COND TRUE ldv_s_misc_fops_file_operations==3
VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=3, ldv_mutex=1, ldv_s_misc_fops_file_operations=3, open_called=0]
[L106] CALL misc_release()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0]
[L34] COND FALSE !(\read(open_called))
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0]
[L41] CALL mutex_lock()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0]
[L16] (ldv_mutex == 1) ? 0 : __blast_assert()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0]
[L17] ldv_mutex = 2
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=2, open_called=0]
[L41] RET mutex_lock()
VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=2, open_called=0]
[L42] CALL mutex_lock()
VAL [\old(ldv_mutex)=2, \old(open_called)=0, ldv_mutex=2, open_called=0]
[L16] (ldv_mutex == 1) ? 0 : __blast_assert()
VAL [\old(ldv_mutex)=2, \old(open_called)=0, ldv_mutex=2, open_called=0]
[L16] CALL __blast_assert()
VAL [\old(ldv_mutex)=2, \old(open_called)=0, ldv_mutex=2, open_called=0]
[L4] __VERIFIER_error()
VAL [\old(ldv_mutex)=2, \old(open_called)=0, ldv_mutex=2, open_called=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 12 procedures, 74 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 618 SDtfs, 430 SDslu, 1137 SDs, 0 SdLazy, 283 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=7, 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, 7 MinimizatonAttempts, 68 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 31627 SizeOfPredicates, 2 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 38/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 185, ITERATIONS: 2, WAS_STRONG: 2, WEAKENING_RATIO: 1.8874847374847374, AVG_VARS_REMOVED_DURING_WEAKENING: 0.7435897435897436, AVG_WEAKENED_CONJUNCTS: 2.2564102564102564, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...