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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:28,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:28,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:28,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:28,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:28,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:28,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:28,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:28,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:28,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:28,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:28,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:28,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:28,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:28,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:28,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:28,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:28,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:28,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:28,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:28,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:28,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:28,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:28,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:28,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:28,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:28,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:28,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:28,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:28,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:28,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:28,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:28,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:28,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:28,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:28,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:28,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:28,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:28,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:28,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:28,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:28,206 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-07 13:28:28,228 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:28,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:28,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:28,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:28,232 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:28,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:28,233 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:28,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:28,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:28,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:28,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:28,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:28,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:28,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:28,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:28,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:28,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:28,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:28,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:28,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:28,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:28,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:28,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:28,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:28,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:28,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:28,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:28,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:28,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:28:28,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:28,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:28,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:28,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:28,539 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:28,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-10-07 13:28:28,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922c1d30d/4d8916f4b7534146a23b35137f4e4b3c/FLAG34f657c9f [2019-10-07 13:28:29,091 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:29,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-10-07 13:28:29,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922c1d30d/4d8916f4b7534146a23b35137f4e4b3c/FLAG34f657c9f [2019-10-07 13:28:29,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922c1d30d/4d8916f4b7534146a23b35137f4e4b3c [2019-10-07 13:28:29,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:29,506 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:29,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:29,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:29,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:29,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7f8ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29, skipping insertion in model container [2019-10-07 13:28:29,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:29,548 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:29,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:29,769 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:29,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:29,902 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:29,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29 WrapperNode [2019-10-07 13:28:29,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:29,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:29,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:29,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:29,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (1/1) ... [2019-10-07 13:28:29,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:29,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:29,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:29,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:29,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (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-07 13:28:30,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:30,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:30,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:30,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:30,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:28:30,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:30,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:30,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:30,608 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:30,609 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:30,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:30 BoogieIcfgContainer [2019-10-07 13:28:30,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:30,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:30,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:30,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:30,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:29" (1/3) ... [2019-10-07 13:28:30,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61af0ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:30, skipping insertion in model container [2019-10-07 13:28:30,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:29" (2/3) ... [2019-10-07 13:28:30,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61af0ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:30, skipping insertion in model container [2019-10-07 13:28:30,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:30" (3/3) ... [2019-10-07 13:28:30,621 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-10-07 13:28:30,632 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:30,644 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:30,656 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:30,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:30,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:30,689 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:30,690 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:30,690 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:30,690 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:30,690 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:30,691 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-07 13:28:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:30,714 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:30,715 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:30,717 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1011430877, now seen corresponding path program 1 times [2019-10-07 13:28:30,730 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:30,730 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:30,730 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:30,730 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:30,967 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-07 13:28:30,968 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:30,969 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:30,969 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:30,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:30,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:30,992 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2019-10-07 13:28:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:31,055 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2019-10-07 13:28:31,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:31,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:28:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:31,070 INFO L225 Difference]: With dead ends: 74 [2019-10-07 13:28:31,070 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 13:28:31,074 INFO L606 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-07 13:28:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 13:28:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2019-10-07 13:28:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 55 transitions. [2019-10-07 13:28:31,121 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 55 transitions. Word has length 10 [2019-10-07 13:28:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:31,122 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 55 transitions. [2019-10-07 13:28:31,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2019-10-07 13:28:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:31,123 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:31,123 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:31,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1289373383, now seen corresponding path program 1 times [2019-10-07 13:28:31,124 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:31,125 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,125 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,125 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:31,215 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-07 13:28:31,216 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,216 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:31,216 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:31,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:31,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:31,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:31,221 INFO L87 Difference]: Start difference. First operand 33 states and 55 transitions. Second operand 4 states. [2019-10-07 13:28:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:31,264 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2019-10-07 13:28:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:31,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:28:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:31,268 INFO L225 Difference]: With dead ends: 59 [2019-10-07 13:28:31,268 INFO L226 Difference]: Without dead ends: 57 [2019-10-07 13:28:31,270 INFO L606 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-07 13:28:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-07 13:28:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2019-10-07 13:28:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2019-10-07 13:28:31,285 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 11 [2019-10-07 13:28:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:31,286 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions. [2019-10-07 13:28:31,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2019-10-07 13:28:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:28:31,288 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:31,288 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:31,288 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:31,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1315656136, now seen corresponding path program 1 times [2019-10-07 13:28:31,289 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:31,289 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:31,405 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-07 13:28:31,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,406 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:31,406 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:31,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:31,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:31,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:31,408 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand 4 states. [2019-10-07 13:28:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:31,447 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2019-10-07 13:28:31,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:31,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:28:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:31,453 INFO L225 Difference]: With dead ends: 57 [2019-10-07 13:28:31,453 INFO L226 Difference]: Without dead ends: 55 [2019-10-07 13:28:31,453 INFO L606 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-07 13:28:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-07 13:28:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-10-07 13:28:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2019-10-07 13:28:31,465 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 12 [2019-10-07 13:28:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:31,465 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2019-10-07 13:28:31,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2019-10-07 13:28:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:28:31,468 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:31,468 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:31,468 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2130421138, now seen corresponding path program 1 times [2019-10-07 13:28:31,470 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:31,470 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,470 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,470 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:31,555 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-07 13:28:31,555 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,556 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:31,556 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:31,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:31,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:31,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:31,561 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 4 states. [2019-10-07 13:28:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:31,604 INFO L93 Difference]: Finished difference Result 55 states and 89 transitions. [2019-10-07 13:28:31,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:31,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:28:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:31,606 INFO L225 Difference]: With dead ends: 55 [2019-10-07 13:28:31,606 INFO L226 Difference]: Without dead ends: 53 [2019-10-07 13:28:31,606 INFO L606 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-07 13:28:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-07 13:28:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2019-10-07 13:28:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2019-10-07 13:28:31,612 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 13 [2019-10-07 13:28:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:31,612 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions. [2019-10-07 13:28:31,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2019-10-07 13:28:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:31,613 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:31,613 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:31,613 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:31,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:31,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1618332083, now seen corresponding path program 1 times [2019-10-07 13:28:31,614 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:31,614 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,615 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,615 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:31,659 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-07 13:28:31,660 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,660 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:31,660 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:31,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:31,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:31,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:31,662 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states. [2019-10-07 13:28:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:31,683 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-10-07 13:28:31,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:31,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:28:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:31,685 INFO L225 Difference]: With dead ends: 53 [2019-10-07 13:28:31,685 INFO L226 Difference]: Without dead ends: 51 [2019-10-07 13:28:31,685 INFO L606 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-07 13:28:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-07 13:28:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-10-07 13:28:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2019-10-07 13:28:31,690 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 14 [2019-10-07 13:28:31,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:31,691 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2019-10-07 13:28:31,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2019-10-07 13:28:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:28:31,692 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:31,692 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:31,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:31,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1371527075, now seen corresponding path program 1 times [2019-10-07 13:28:31,693 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:31,693 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,693 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,693 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:31,738 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-07 13:28:31,739 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,739 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:31,740 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:31,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:31,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:31,741 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 4 states. [2019-10-07 13:28:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:31,769 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2019-10-07 13:28:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:31,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:28:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:31,770 INFO L225 Difference]: With dead ends: 51 [2019-10-07 13:28:31,770 INFO L226 Difference]: Without dead ends: 49 [2019-10-07 13:28:31,771 INFO L606 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-07 13:28:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-07 13:28:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-10-07 13:28:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2019-10-07 13:28:31,776 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 15 [2019-10-07 13:28:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:31,776 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-10-07 13:28:31,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2019-10-07 13:28:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:28:31,777 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:31,777 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:31,778 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:31,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:31,778 INFO L82 PathProgramCache]: Analyzing trace with hash -432119198, now seen corresponding path program 1 times [2019-10-07 13:28:31,778 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:31,778 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:31,819 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,819 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:31,819 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:31,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:31,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:31,820 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 4 states. [2019-10-07 13:28:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:31,861 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. [2019-10-07 13:28:31,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:31,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-07 13:28:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:31,862 INFO L225 Difference]: With dead ends: 49 [2019-10-07 13:28:31,862 INFO L226 Difference]: Without dead ends: 47 [2019-10-07 13:28:31,863 INFO L606 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-07 13:28:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-07 13:28:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-10-07 13:28:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-10-07 13:28:31,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 16 [2019-10-07 13:28:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:31,869 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-10-07 13:28:31,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-10-07 13:28:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:28:31,870 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:31,870 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:31,871 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:31,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:31,872 INFO L82 PathProgramCache]: Analyzing trace with hash -510578472, now seen corresponding path program 1 times [2019-10-07 13:28:31,872 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:31,872 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:31,944 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-07 13:28:31,945 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,946 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:31,946 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:31,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:31,947 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 4 states. [2019-10-07 13:28:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:31,976 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2019-10-07 13:28:31,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:31,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-07 13:28:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:31,978 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:28:31,980 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 13:28:31,981 INFO L606 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-07 13:28:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 13:28:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-10-07 13:28:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2019-10-07 13:28:31,989 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 17 [2019-10-07 13:28:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:31,990 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2019-10-07 13:28:31,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2019-10-07 13:28:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:28:31,994 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:31,994 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:31,994 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1352151671, now seen corresponding path program 1 times [2019-10-07 13:28:31,995 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:31,996 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:31,996 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,996 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:32,054 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-07 13:28:32,054 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,055 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:32,055 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:32,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:32,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:32,057 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 4 states. [2019-10-07 13:28:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:32,081 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-10-07 13:28:32,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:32,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-07 13:28:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:32,082 INFO L225 Difference]: With dead ends: 45 [2019-10-07 13:28:32,082 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 13:28:32,083 INFO L606 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-07 13:28:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 13:28:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-10-07 13:28:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-10-07 13:28:32,092 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 18 [2019-10-07 13:28:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:32,092 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-10-07 13:28:32,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-10-07 13:28:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:28:32,093 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:32,093 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:32,094 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:32,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1032755699, now seen corresponding path program 1 times [2019-10-07 13:28:32,097 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:32,098 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,098 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:32,098 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:32,156 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-07 13:28:32,157 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,157 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:32,157 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:32,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:32,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:32,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:32,158 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 4 states. [2019-10-07 13:28:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:32,180 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2019-10-07 13:28:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:32,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-07 13:28:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:32,181 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:28:32,181 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 13:28:32,182 INFO L606 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-07 13:28:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 13:28:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-10-07 13:28:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2019-10-07 13:28:32,185 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 19 [2019-10-07 13:28:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:32,186 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-10-07 13:28:32,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2019-10-07 13:28:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:28:32,187 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:32,187 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:32,187 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1950439796, now seen corresponding path program 1 times [2019-10-07 13:28:32,188 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:32,188 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,188 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:32,188 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:32,224 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-07 13:28:32,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,224 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:32,225 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:32,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:32,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:32,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:32,226 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 4 states. [2019-10-07 13:28:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:32,244 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-10-07 13:28:32,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:32,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-07 13:28:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:32,246 INFO L225 Difference]: With dead ends: 41 [2019-10-07 13:28:32,246 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 13:28:32,247 INFO L606 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-07 13:28:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 13:28:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-10-07 13:28:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2019-10-07 13:28:32,253 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2019-10-07 13:28:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:32,258 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-10-07 13:28:32,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2019-10-07 13:28:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:28:32,259 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:32,259 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:32,259 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:32,260 INFO L82 PathProgramCache]: Analyzing trace with hash -333875390, now seen corresponding path program 1 times [2019-10-07 13:28:32,260 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:32,260 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,260 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:32,260 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:32,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:32,297 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-07 13:28:32,297 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,298 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:32,299 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:32,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:32,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:32,300 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 4 states. [2019-10-07 13:28:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:32,317 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-10-07 13:28:32,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:32,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-07 13:28:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:32,318 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:28:32,318 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:28:32,319 INFO L606 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-07 13:28:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:28:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:28:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:28:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:28:32,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-07 13:28:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:32,322 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:28:32,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:28:32,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:28:32,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:28:32,350 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:28:32,350 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:32,351 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:32,351 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:28:32,351 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:28:32,351 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:28:32,351 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,351 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2019-10-07 13:28:32,351 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,352 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,352 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-07 13:28:32,352 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-07 13:28:32,352 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-07 13:28:32,352 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,352 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,352 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,353 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2019-10-07 13:28:32,353 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-07 13:28:32,353 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-07 13:28:32,353 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2019-10-07 13:28:32,353 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-10-07 13:28:32,353 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,353 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-10-07 13:28:32,354 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,354 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-07 13:28:32,354 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-07 13:28:32,354 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-10-07 13:28:32,354 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,354 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,354 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-10-07 13:28:32,355 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-07 13:28:32,355 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-07 13:28:32,355 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-10-07 13:28:32,356 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-10-07 13:28:32,356 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,356 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-10-07 13:28:32,357 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-07 13:28:32,357 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-10-07 13:28:32,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:28:32 BoogieIcfgContainer [2019-10-07 13:28:32,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:28:32,374 INFO L168 Benchmark]: Toolchain (without parser) took 2864.46 ms. Allocated memory was 141.0 MB in the beginning and 235.4 MB in the end (delta: 94.4 MB). Free memory was 102.6 MB in the beginning and 126.2 MB in the end (delta: -23.6 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:32,376 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:28:32,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.45 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 102.4 MB in the beginning and 182.3 MB in the end (delta: -79.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:32,384 INFO L168 Benchmark]: Boogie Preprocessor took 39.85 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 179.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:32,385 INFO L168 Benchmark]: RCFGBuilder took 666.35 ms. Allocated memory is still 203.4 MB. Free memory was 179.9 MB in the beginning and 138.9 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:32,386 INFO L168 Benchmark]: TraceAbstraction took 1756.67 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 138.3 MB in the beginning and 126.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:32,399 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 396.45 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 102.4 MB in the beginning and 182.3 MB in the end (delta: -79.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.85 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 179.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 666.35 ms. Allocated memory is still 203.4 MB. Free memory was 179.9 MB in the beginning and 138.9 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1756.67 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 138.3 MB in the beginning and 126.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 578 SDtfs, 446 SDslu, 829 SDs, 0 SdLazy, 108 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, 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, 12 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 10658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...