/usr/bin/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 -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:25:06,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:25:06,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:25:06,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:25:06,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:25:06,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:25:06,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:25:06,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:25:06,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:25:06,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:25:06,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:25:06,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:25:06,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:25:06,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:25:06,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:25:06,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:25:06,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:25:06,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:25:06,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:25:06,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:25:06,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:25:06,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:25:06,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:25:06,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:25:06,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:25:06,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:25:06,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:25:06,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:25:06,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:25:06,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:25:06,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:25:06,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:25:06,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:25:06,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:25:06,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:25:06,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:25:06,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:25:06,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:25:06,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:25:06,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:25:06,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:25:06,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:25:06,855 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:25:06,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:25:06,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:25:06,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:25:06,857 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:25:06,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:25:06,858 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:25:06,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:25:06,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:25:06,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:25:06,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:25:06,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:25:06,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:25:06,859 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:25:06,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:25:06,860 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:25:06,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:25:06,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:25:06,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:25:06,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:25:06,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:25:06,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:25:06,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:25:06,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:25:06,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:25:06,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:25:06,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:25:06,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:25:06,863 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:25:06,863 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:25:07,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:25:07,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:25:07,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:25:07,339 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:25:07,339 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:25:07,340 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-09-04 13:25:07,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4480e2c0d/d0cb3d3856714e90aa5f5dd9acd04993/FLAG3108c7db4 [2020-09-04 13:25:07,990 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:25:07,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_7.c [2020-09-04 13:25:08,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4480e2c0d/d0cb3d3856714e90aa5f5dd9acd04993/FLAG3108c7db4 [2020-09-04 13:25:08,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4480e2c0d/d0cb3d3856714e90aa5f5dd9acd04993 [2020-09-04 13:25:08,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:25:08,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:25:08,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:25:08,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:25:08,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:25:08,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df08b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08, skipping insertion in model container [2020-09-04 13:25:08,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:25:08,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:25:08,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:25:08,653 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:25:08,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:25:08,694 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:25:08,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08 WrapperNode [2020-09-04 13:25:08,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:25:08,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:25:08,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:25:08,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:25:08,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (1/1) ... [2020-09-04 13:25:08,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:25:08,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:25:08,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:25:08,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:25:08,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:08,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:25:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:25:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:25:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:25:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:25:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:25:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:25:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:25:09,198 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:25:09,198 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:25:09,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:25:09 BoogieIcfgContainer [2020-09-04 13:25:09,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:25:09,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:25:09,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:25:09,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:25:09,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:25:08" (1/3) ... [2020-09-04 13:25:09,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7336f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:25:09, skipping insertion in model container [2020-09-04 13:25:09,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:08" (2/3) ... [2020-09-04 13:25:09,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7336f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:25:09, skipping insertion in model container [2020-09-04 13:25:09,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:25:09" (3/3) ... [2020-09-04 13:25:09,214 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-09-04 13:25:09,227 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:25:09,238 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:25:09,265 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:25:09,303 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:25:09,303 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:25:09,303 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:25:09,303 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:25:09,303 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:25:09,304 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:25:09,304 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:25:09,304 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:25:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-09-04 13:25:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 13:25:09,364 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:09,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:09,366 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2020-09-04 13:25:09,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:09,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503116555] [2020-09-04 13:25:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:09,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:09,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503116555] [2020-09-04 13:25:09,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:09,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:09,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116502636] [2020-09-04 13:25:09,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:09,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:09,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:09,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:09,652 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-09-04 13:25:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:09,722 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2020-09-04 13:25:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:09,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-09-04 13:25:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:09,740 INFO L225 Difference]: With dead ends: 69 [2020-09-04 13:25:09,740 INFO L226 Difference]: Without dead ends: 54 [2020-09-04 13:25:09,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-04 13:25:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2020-09-04 13:25:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 13:25:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2020-09-04 13:25:09,799 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2020-09-04 13:25:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:09,800 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2020-09-04 13:25:09,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2020-09-04 13:25:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 13:25:09,801 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:09,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:09,802 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:25:09,803 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:09,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2020-09-04 13:25:09,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:09,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678249285] [2020-09-04 13:25:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:09,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:09,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678249285] [2020-09-04 13:25:09,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:09,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:09,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24688507] [2020-09-04 13:25:09,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:09,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:09,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:09,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:09,867 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2020-09-04 13:25:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:09,895 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2020-09-04 13:25:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:09,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-09-04 13:25:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:09,898 INFO L225 Difference]: With dead ends: 87 [2020-09-04 13:25:09,898 INFO L226 Difference]: Without dead ends: 54 [2020-09-04 13:25:09,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-04 13:25:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-09-04 13:25:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 13:25:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2020-09-04 13:25:09,910 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2020-09-04 13:25:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:09,911 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2020-09-04 13:25:09,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2020-09-04 13:25:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 13:25:09,912 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:09,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:09,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:25:09,913 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:09,913 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2020-09-04 13:25:09,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:09,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425888878] [2020-09-04 13:25:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:09,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:09,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425888878] [2020-09-04 13:25:09,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:09,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:09,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596392309] [2020-09-04 13:25:09,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:09,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:09,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,002 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2020-09-04 13:25:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,039 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2020-09-04 13:25:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-09-04 13:25:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,042 INFO L225 Difference]: With dead ends: 81 [2020-09-04 13:25:10,042 INFO L226 Difference]: Without dead ends: 57 [2020-09-04 13:25:10,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-04 13:25:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2020-09-04 13:25:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 13:25:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2020-09-04 13:25:10,053 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2020-09-04 13:25:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,054 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2020-09-04 13:25:10,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2020-09-04 13:25:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 13:25:10,055 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:25:10,056 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2020-09-04 13:25:10,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597899278] [2020-09-04 13:25:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597899278] [2020-09-04 13:25:10,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520288440] [2020-09-04 13:25:10,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,105 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2020-09-04 13:25:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,146 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2020-09-04 13:25:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-09-04 13:25:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,148 INFO L225 Difference]: With dead ends: 100 [2020-09-04 13:25:10,148 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 13:25:10,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 13:25:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2020-09-04 13:25:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 13:25:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2020-09-04 13:25:10,161 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2020-09-04 13:25:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,162 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2020-09-04 13:25:10,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2020-09-04 13:25:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 13:25:10,163 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:25:10,164 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,164 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2020-09-04 13:25:10,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616097083] [2020-09-04 13:25:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616097083] [2020-09-04 13:25:10,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965150072] [2020-09-04 13:25:10,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,208 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2020-09-04 13:25:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,232 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2020-09-04 13:25:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-09-04 13:25:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,235 INFO L225 Difference]: With dead ends: 164 [2020-09-04 13:25:10,235 INFO L226 Difference]: Without dead ends: 100 [2020-09-04 13:25:10,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-09-04 13:25:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2020-09-04 13:25:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 13:25:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2020-09-04 13:25:10,248 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2020-09-04 13:25:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,249 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2020-09-04 13:25:10,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2020-09-04 13:25:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:25:10,250 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:25:10,251 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2020-09-04 13:25:10,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596210015] [2020-09-04 13:25:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596210015] [2020-09-04 13:25:10,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377445] [2020-09-04 13:25:10,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,296 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2020-09-04 13:25:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,318 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2020-09-04 13:25:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-04 13:25:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,321 INFO L225 Difference]: With dead ends: 147 [2020-09-04 13:25:10,321 INFO L226 Difference]: Without dead ends: 102 [2020-09-04 13:25:10,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-09-04 13:25:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2020-09-04 13:25:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 13:25:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2020-09-04 13:25:10,334 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2020-09-04 13:25:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,335 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2020-09-04 13:25:10,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2020-09-04 13:25:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:25:10,336 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:25:10,337 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2020-09-04 13:25:10,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027785522] [2020-09-04 13:25:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027785522] [2020-09-04 13:25:10,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193504282] [2020-09-04 13:25:10,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,378 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2020-09-04 13:25:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,397 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2020-09-04 13:25:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-04 13:25:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,400 INFO L225 Difference]: With dead ends: 180 [2020-09-04 13:25:10,400 INFO L226 Difference]: Without dead ends: 178 [2020-09-04 13:25:10,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-09-04 13:25:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2020-09-04 13:25:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-09-04 13:25:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2020-09-04 13:25:10,422 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2020-09-04 13:25:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,424 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2020-09-04 13:25:10,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2020-09-04 13:25:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:25:10,425 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:25:10,427 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2020-09-04 13:25:10,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173607103] [2020-09-04 13:25:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173607103] [2020-09-04 13:25:10,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466007798] [2020-09-04 13:25:10,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,490 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2020-09-04 13:25:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,531 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2020-09-04 13:25:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-04 13:25:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,534 INFO L225 Difference]: With dead ends: 312 [2020-09-04 13:25:10,534 INFO L226 Difference]: Without dead ends: 186 [2020-09-04 13:25:10,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-09-04 13:25:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2020-09-04 13:25:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-09-04 13:25:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2020-09-04 13:25:10,556 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2020-09-04 13:25:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,557 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2020-09-04 13:25:10,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2020-09-04 13:25:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:10,563 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:25:10,564 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2020-09-04 13:25:10,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747390338] [2020-09-04 13:25:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747390338] [2020-09-04 13:25:10,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689812090] [2020-09-04 13:25:10,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,635 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2020-09-04 13:25:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,657 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2020-09-04 13:25:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,659 INFO L225 Difference]: With dead ends: 276 [2020-09-04 13:25:10,659 INFO L226 Difference]: Without dead ends: 190 [2020-09-04 13:25:10,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-09-04 13:25:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2020-09-04 13:25:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-09-04 13:25:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2020-09-04 13:25:10,673 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2020-09-04 13:25:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,673 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2020-09-04 13:25:10,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2020-09-04 13:25:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:10,675 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:25:10,676 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2020-09-04 13:25:10,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486369923] [2020-09-04 13:25:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486369923] [2020-09-04 13:25:10,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89081252] [2020-09-04 13:25:10,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,709 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2020-09-04 13:25:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,730 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2020-09-04 13:25:10,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,733 INFO L225 Difference]: With dead ends: 332 [2020-09-04 13:25:10,733 INFO L226 Difference]: Without dead ends: 330 [2020-09-04 13:25:10,734 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-09-04 13:25:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2020-09-04 13:25:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-09-04 13:25:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2020-09-04 13:25:10,746 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2020-09-04 13:25:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,746 INFO L479 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2020-09-04 13:25:10,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2020-09-04 13:25:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:10,748 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:25:10,749 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2020-09-04 13:25:10,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549886580] [2020-09-04 13:25:10,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549886580] [2020-09-04 13:25:10,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486258609] [2020-09-04 13:25:10,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,793 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2020-09-04 13:25:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,843 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2020-09-04 13:25:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,847 INFO L225 Difference]: With dead ends: 604 [2020-09-04 13:25:10,847 INFO L226 Difference]: Without dead ends: 354 [2020-09-04 13:25:10,849 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-09-04 13:25:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2020-09-04 13:25:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-09-04 13:25:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2020-09-04 13:25:10,877 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2020-09-04 13:25:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,877 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2020-09-04 13:25:10,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2020-09-04 13:25:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:10,880 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:25:10,881 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2020-09-04 13:25:10,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302538282] [2020-09-04 13:25:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:10,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302538282] [2020-09-04 13:25:10,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:10,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:10,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248831491] [2020-09-04 13:25:10,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:10,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:10,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:10,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,928 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2020-09-04 13:25:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,948 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2020-09-04 13:25:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,951 INFO L225 Difference]: With dead ends: 528 [2020-09-04 13:25:10,951 INFO L226 Difference]: Without dead ends: 362 [2020-09-04 13:25:10,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-09-04 13:25:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2020-09-04 13:25:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-09-04 13:25:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2020-09-04 13:25:10,965 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2020-09-04 13:25:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,965 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2020-09-04 13:25:10,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2020-09-04 13:25:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:10,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:10,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:10,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:25:10,967 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:10,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2020-09-04 13:25:10,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:10,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693344031] [2020-09-04 13:25:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:10,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:11,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693344031] [2020-09-04 13:25:11,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:11,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:11,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710404192] [2020-09-04 13:25:11,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:11,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:11,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:11,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,005 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2020-09-04 13:25:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:11,032 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2020-09-04 13:25:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:11,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:11,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:11,037 INFO L225 Difference]: With dead ends: 620 [2020-09-04 13:25:11,037 INFO L226 Difference]: Without dead ends: 618 [2020-09-04 13:25:11,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-09-04 13:25:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2020-09-04 13:25:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2020-09-04 13:25:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2020-09-04 13:25:11,057 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2020-09-04 13:25:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:11,057 INFO L479 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2020-09-04 13:25:11,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2020-09-04 13:25:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:11,059 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:11,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:11,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:25:11,059 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2020-09-04 13:25:11,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:11,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115428950] [2020-09-04 13:25:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:11,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115428950] [2020-09-04 13:25:11,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:11,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:11,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501531632] [2020-09-04 13:25:11,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:11,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:11,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,090 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2020-09-04 13:25:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:11,118 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2020-09-04 13:25:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:11,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:11,122 INFO L225 Difference]: With dead ends: 1180 [2020-09-04 13:25:11,122 INFO L226 Difference]: Without dead ends: 682 [2020-09-04 13:25:11,124 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-09-04 13:25:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2020-09-04 13:25:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-09-04 13:25:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2020-09-04 13:25:11,147 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2020-09-04 13:25:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:11,148 INFO L479 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2020-09-04 13:25:11,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2020-09-04 13:25:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:11,149 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:11,150 INFO L422 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] [2020-09-04 13:25:11,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:25:11,150 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:11,150 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2020-09-04 13:25:11,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:11,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366663412] [2020-09-04 13:25:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:11,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366663412] [2020-09-04 13:25:11,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:11,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:11,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351374424] [2020-09-04 13:25:11,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:11,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:11,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:11,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,176 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2020-09-04 13:25:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:11,200 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2020-09-04 13:25:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:11,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:11,205 INFO L225 Difference]: With dead ends: 1020 [2020-09-04 13:25:11,205 INFO L226 Difference]: Without dead ends: 698 [2020-09-04 13:25:11,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-09-04 13:25:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2020-09-04 13:25:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-09-04 13:25:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2020-09-04 13:25:11,230 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2020-09-04 13:25:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:11,231 INFO L479 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2020-09-04 13:25:11,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2020-09-04 13:25:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:11,233 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:11,233 INFO L422 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] [2020-09-04 13:25:11,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:25:11,233 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2020-09-04 13:25:11,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:11,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086591393] [2020-09-04 13:25:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:11,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086591393] [2020-09-04 13:25:11,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:11,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:11,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746978562] [2020-09-04 13:25:11,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:11,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:11,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:11,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,263 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2020-09-04 13:25:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:11,301 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2020-09-04 13:25:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:11,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:11,308 INFO L225 Difference]: With dead ends: 1164 [2020-09-04 13:25:11,309 INFO L226 Difference]: Without dead ends: 1162 [2020-09-04 13:25:11,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-09-04 13:25:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2020-09-04 13:25:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2020-09-04 13:25:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2020-09-04 13:25:11,347 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2020-09-04 13:25:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:11,348 INFO L479 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2020-09-04 13:25:11,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2020-09-04 13:25:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:11,350 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:11,350 INFO L422 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] [2020-09-04 13:25:11,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:25:11,351 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:11,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2020-09-04 13:25:11,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:11,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444892261] [2020-09-04 13:25:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:11,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444892261] [2020-09-04 13:25:11,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:11,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:11,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371099906] [2020-09-04 13:25:11,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:11,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:11,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,377 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2020-09-04 13:25:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:11,432 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2020-09-04 13:25:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:11,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:11,438 INFO L225 Difference]: With dead ends: 2316 [2020-09-04 13:25:11,439 INFO L226 Difference]: Without dead ends: 1322 [2020-09-04 13:25:11,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2020-09-04 13:25:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2020-09-04 13:25:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2020-09-04 13:25:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2020-09-04 13:25:11,486 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2020-09-04 13:25:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:11,486 INFO L479 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2020-09-04 13:25:11,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2020-09-04 13:25:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:11,489 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:11,489 INFO L422 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] [2020-09-04 13:25:11,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:25:11,489 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2020-09-04 13:25:11,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:11,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632678268] [2020-09-04 13:25:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:11,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632678268] [2020-09-04 13:25:11,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:11,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:11,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006633296] [2020-09-04 13:25:11,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:11,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:11,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,516 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2020-09-04 13:25:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:11,558 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2020-09-04 13:25:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:11,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:11,564 INFO L225 Difference]: With dead ends: 1980 [2020-09-04 13:25:11,565 INFO L226 Difference]: Without dead ends: 1354 [2020-09-04 13:25:11,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-09-04 13:25:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2020-09-04 13:25:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2020-09-04 13:25:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2020-09-04 13:25:11,610 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2020-09-04 13:25:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:11,611 INFO L479 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2020-09-04 13:25:11,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2020-09-04 13:25:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:11,614 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:11,614 INFO L422 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] [2020-09-04 13:25:11,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:25:11,614 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2020-09-04 13:25:11,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:11,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483321776] [2020-09-04 13:25:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:11,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483321776] [2020-09-04 13:25:11,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:11,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:11,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747655529] [2020-09-04 13:25:11,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:11,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,645 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2020-09-04 13:25:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:11,695 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2020-09-04 13:25:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:11,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:11,705 INFO L225 Difference]: With dead ends: 2186 [2020-09-04 13:25:11,706 INFO L226 Difference]: Without dead ends: 2184 [2020-09-04 13:25:11,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2020-09-04 13:25:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2020-09-04 13:25:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2020-09-04 13:25:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2020-09-04 13:25:11,771 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2020-09-04 13:25:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:11,771 INFO L479 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2020-09-04 13:25:11,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2020-09-04 13:25:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:11,775 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:11,775 INFO L422 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] [2020-09-04 13:25:11,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 13:25:11,776 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:11,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2020-09-04 13:25:11,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:11,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511911264] [2020-09-04 13:25:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:11,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511911264] [2020-09-04 13:25:11,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:11,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:11,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983804001] [2020-09-04 13:25:11,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:11,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,804 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2020-09-04 13:25:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:11,889 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2020-09-04 13:25:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:11,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:11,891 INFO L225 Difference]: With dead ends: 4552 [2020-09-04 13:25:11,891 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:25:11,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:25:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:25:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:25:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:25:11,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-09-04 13:25:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:11,903 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:25:11,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:25:11,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:25:11,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:25:11,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:25:11,940 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 13:25:11,941 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:11,941 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:11,941 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 13:25:11,941 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:25:11,942 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:25:11,942 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2020-09-04 13:25:11,942 INFO L268 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2020-09-04 13:25:11,942 INFO L268 CegarLoopResult]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,942 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-09-04 13:25:11,943 INFO L268 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2020-09-04 13:25:11,943 INFO L268 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2020-09-04 13:25:11,943 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-09-04 13:25:11,943 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2020-09-04 13:25:11,943 INFO L268 CegarLoopResult]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,944 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2020-09-04 13:25:11,944 INFO L268 CegarLoopResult]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,944 INFO L268 CegarLoopResult]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,944 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-09-04 13:25:11,944 INFO L268 CegarLoopResult]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,945 INFO L268 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2020-09-04 13:25:11,945 INFO L268 CegarLoopResult]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,945 INFO L268 CegarLoopResult]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,945 INFO L268 CegarLoopResult]: For program point L32(lines 32 34) no Hoare annotation was computed. [2020-09-04 13:25:11,945 INFO L268 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-09-04 13:25:11,947 INFO L268 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-09-04 13:25:11,947 INFO L268 CegarLoopResult]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,947 INFO L268 CegarLoopResult]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,947 INFO L268 CegarLoopResult]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,948 INFO L268 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-09-04 13:25:11,948 INFO L268 CegarLoopResult]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,948 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-09-04 13:25:11,948 INFO L268 CegarLoopResult]: For program point L51(lines 51 53) no Hoare annotation was computed. [2020-09-04 13:25:11,948 INFO L268 CegarLoopResult]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,949 INFO L268 CegarLoopResult]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2020-09-04 13:25:11,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:25:11 BoogieIcfgContainer [2020-09-04 13:25:11,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:25:11,978 INFO L168 Benchmark]: Toolchain (without parser) took 3625.79 ms. Allocated memory was 138.9 MB in the beginning and 247.5 MB in the end (delta: 108.5 MB). Free memory was 101.9 MB in the beginning and 101.0 MB in the end (delta: 916.0 kB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:11,979 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 138.9 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:25:11,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.13 ms. Allocated memory is still 138.9 MB. Free memory was 101.7 MB in the beginning and 91.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:11,980 INFO L168 Benchmark]: Boogie Preprocessor took 133.77 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 91.5 MB in the beginning and 179.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:11,986 INFO L168 Benchmark]: RCFGBuilder took 374.75 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 163.3 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:11,989 INFO L168 Benchmark]: TraceAbstraction took 2768.44 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 162.6 MB in the beginning and 101.0 MB in the end (delta: 61.6 MB). Peak memory consumption was 107.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:11,995 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43 ms. Allocated memory is still 138.9 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 343.13 ms. Allocated memory is still 138.9 MB. Free memory was 101.7 MB in the beginning and 91.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.77 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 91.5 MB in the beginning and 179.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 374.75 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 163.3 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2768.44 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 162.6 MB in the beginning and 101.0 MB in the end (delta: 61.6 MB). Peak memory consumption was 107.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 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, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...