/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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:24:53,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:24:53,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:24:53,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:24:53,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:24:53,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:24:53,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:24:53,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:24:53,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:24:53,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:24:53,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:24:53,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:24:53,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:24:53,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:24:53,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:24:53,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:24:53,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:24:53,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:24:53,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:24:53,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:24:53,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:24:53,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:24:53,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:24:53,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:24:53,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:24:53,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:24:53,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:24:53,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:24:53,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:24:53,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:24:53,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:24:53,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:24:53,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:24:53,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:24:53,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:24:53,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:24:53,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:24:53,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:24:53,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:24:53,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:24:53,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:24:53,474 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:24:53,516 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:24:53,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:24:53,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:24:53,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:24:53,519 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:24:53,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:24:53,520 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:24:53,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:24:53,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:24:53,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:24:53,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:24:53,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:24:53,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:24:53,522 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:24:53,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:24:53,522 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:24:53,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:24:53,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:24:53,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:24:53,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:24:53,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:24:53,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:24:53,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:24:53,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:24:53,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:24:53,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:24:53,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:24:53,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:24:53,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:24:53,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:24:54,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:24:54,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:24:54,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:24:54,026 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:24:54,027 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:24:54,028 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2020-09-04 13:24:54,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f087f2ceb/8afe5fa193e44630ab670cd7e1a8823c/FLAG4acb1d679 [2020-09-04 13:24:54,639 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:24:54,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_10.c [2020-09-04 13:24:54,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f087f2ceb/8afe5fa193e44630ab670cd7e1a8823c/FLAG4acb1d679 [2020-09-04 13:24:54,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f087f2ceb/8afe5fa193e44630ab670cd7e1a8823c [2020-09-04 13:24:54,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:24:54,942 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:24:54,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:24:54,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:24:54,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:24:54,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:24:54" (1/1) ... [2020-09-04 13:24:54,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d72532b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:54, skipping insertion in model container [2020-09-04 13:24:54,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:24:54" (1/1) ... [2020-09-04 13:24:54,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:24:55,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:24:55,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:24:55,271 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:24:55,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:24:55,316 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:24:55,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55 WrapperNode [2020-09-04 13:24:55,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:24:55,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:24:55,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:24:55,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:24:55,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:24:55,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:24:55,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:24:55,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:24:55,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (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:24:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:24:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:24:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:24:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:24:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:24:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:24:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:24:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:24:55,844 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:24:55,845 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:24:55,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:24:55 BoogieIcfgContainer [2020-09-04 13:24:55,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:24:55,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:24:55,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:24:55,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:24:55,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:24:54" (1/3) ... [2020-09-04 13:24:55,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d72e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:24:55, skipping insertion in model container [2020-09-04 13:24:55,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55" (2/3) ... [2020-09-04 13:24:55,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d72e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:24:55, skipping insertion in model container [2020-09-04 13:24:55,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:24:55" (3/3) ... [2020-09-04 13:24:55,861 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2020-09-04 13:24:55,874 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:24:55,885 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:24:55,933 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:24:55,985 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:24:55,986 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:24:55,986 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:24:55,986 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:24:55,987 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:24:55,987 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:24:55,987 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:24:55,987 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:24:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-09-04 13:24:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:24:56,016 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:56,017 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:24:56,018 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2020-09-04 13:24:56,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:56,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273622566] [2020-09-04 13:24:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,277 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:24:56,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273622566] [2020-09-04 13:24:56,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:56,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:56,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396981258] [2020-09-04 13:24:56,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:56,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:56,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:56,311 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-09-04 13:24:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:56,408 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2020-09-04 13:24:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:56,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:24:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:56,424 INFO L225 Difference]: With dead ends: 87 [2020-09-04 13:24:56,424 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 13:24:56,428 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:24:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 13:24:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-09-04 13:24:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 13:24:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2020-09-04 13:24:56,477 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2020-09-04 13:24:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:56,478 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2020-09-04 13:24:56,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2020-09-04 13:24:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:24:56,479 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:56,480 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:24:56,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:24:56,480 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2020-09-04 13:24:56,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:56,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165323854] [2020-09-04 13:24:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,558 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:24:56,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165323854] [2020-09-04 13:24:56,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:56,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:56,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642985956] [2020-09-04 13:24:56,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:56,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:56,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:56,563 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2020-09-04 13:24:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:56,591 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2020-09-04 13:24:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:56,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:24:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:56,594 INFO L225 Difference]: With dead ends: 117 [2020-09-04 13:24:56,595 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 13:24:56,596 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:24:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 13:24:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-09-04 13:24:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 13:24:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2020-09-04 13:24:56,610 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2020-09-04 13:24:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:56,610 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2020-09-04 13:24:56,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2020-09-04 13:24:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:24:56,612 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:56,612 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:24:56,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:24:56,613 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:56,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2020-09-04 13:24:56,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:56,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077699443] [2020-09-04 13:24:56,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,681 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:24:56,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077699443] [2020-09-04 13:24:56,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:56,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:56,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841647208] [2020-09-04 13:24:56,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:56,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:56,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:56,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:56,684 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2020-09-04 13:24:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:56,720 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2020-09-04 13:24:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:56,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:24:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:56,722 INFO L225 Difference]: With dead ends: 108 [2020-09-04 13:24:56,723 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 13:24:56,724 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:24:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 13:24:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-09-04 13:24:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 13:24:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2020-09-04 13:24:56,740 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2020-09-04 13:24:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:56,741 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2020-09-04 13:24:56,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2020-09-04 13:24:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:24:56,745 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:56,746 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:24:56,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:24:56,746 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2020-09-04 13:24:56,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:56,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426484196] [2020-09-04 13:24:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,831 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:24:56,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426484196] [2020-09-04 13:24:56,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:56,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:56,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567552473] [2020-09-04 13:24:56,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:56,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:56,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:56,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:56,834 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2020-09-04 13:24:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:56,856 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2020-09-04 13:24:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:56,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:24:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:56,859 INFO L225 Difference]: With dead ends: 136 [2020-09-04 13:24:56,859 INFO L226 Difference]: Without dead ends: 134 [2020-09-04 13:24:56,860 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:24:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-09-04 13:24:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2020-09-04 13:24:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-09-04 13:24:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2020-09-04 13:24:56,878 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2020-09-04 13:24:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:56,878 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2020-09-04 13:24:56,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2020-09-04 13:24:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:24:56,880 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:56,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:24:56,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:24:56,880 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:56,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:56,881 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2020-09-04 13:24:56,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:56,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014308934] [2020-09-04 13:24:56,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:56,954 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:24:56,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014308934] [2020-09-04 13:24:56,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:56,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:56,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744222145] [2020-09-04 13:24:56,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:56,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:56,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:56,958 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2020-09-04 13:24:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,006 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2020-09-04 13:24:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:24:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,009 INFO L225 Difference]: With dead ends: 224 [2020-09-04 13:24:57,009 INFO L226 Difference]: Without dead ends: 136 [2020-09-04 13:24:57,010 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:24:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-09-04 13:24:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2020-09-04 13:24:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-09-04 13:24:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2020-09-04 13:24:57,026 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2020-09-04 13:24:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,027 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2020-09-04 13:24:57,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2020-09-04 13:24:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:24:57,029 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,029 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:24:57,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:24:57,030 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2020-09-04 13:24:57,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762215479] [2020-09-04 13:24:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,071 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:24:57,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762215479] [2020-09-04 13:24:57,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351157467] [2020-09-04 13:24:57,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,074 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2020-09-04 13:24:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,094 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2020-09-04 13:24:57,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:24:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,097 INFO L225 Difference]: With dead ends: 201 [2020-09-04 13:24:57,097 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 13:24:57,101 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:24:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 13:24:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-09-04 13:24:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-09-04 13:24:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2020-09-04 13:24:57,140 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2020-09-04 13:24:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,140 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2020-09-04 13:24:57,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2020-09-04 13:24:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:24:57,143 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,143 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:24:57,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:24:57,144 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,144 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2020-09-04 13:24:57,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825193317] [2020-09-04 13:24:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,180 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:24:57,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825193317] [2020-09-04 13:24:57,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836888738] [2020-09-04 13:24:57,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,183 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2020-09-04 13:24:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,209 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2020-09-04 13:24:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:24:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,214 INFO L225 Difference]: With dead ends: 252 [2020-09-04 13:24:57,214 INFO L226 Difference]: Without dead ends: 250 [2020-09-04 13:24:57,215 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:24:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-09-04 13:24:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2020-09-04 13:24:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-09-04 13:24:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2020-09-04 13:24:57,237 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2020-09-04 13:24:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,238 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2020-09-04 13:24:57,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2020-09-04 13:24:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:24:57,240 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,240 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:24:57,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:24:57,241 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2020-09-04 13:24:57,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003917459] [2020-09-04 13:24:57,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,292 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:24:57,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003917459] [2020-09-04 13:24:57,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333467830] [2020-09-04 13:24:57,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,296 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2020-09-04 13:24:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,323 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2020-09-04 13:24:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:24:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,326 INFO L225 Difference]: With dead ends: 432 [2020-09-04 13:24:57,326 INFO L226 Difference]: Without dead ends: 258 [2020-09-04 13:24:57,328 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:24:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-09-04 13:24:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2020-09-04 13:24:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 13:24:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2020-09-04 13:24:57,343 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2020-09-04 13:24:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,344 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2020-09-04 13:24:57,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2020-09-04 13:24:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:24:57,346 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,346 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:24:57,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:24:57,347 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2020-09-04 13:24:57,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015493381] [2020-09-04 13:24:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,381 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:24:57,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015493381] [2020-09-04 13:24:57,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919647129] [2020-09-04 13:24:57,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,384 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2020-09-04 13:24:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,404 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2020-09-04 13:24:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:24:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,407 INFO L225 Difference]: With dead ends: 384 [2020-09-04 13:24:57,407 INFO L226 Difference]: Without dead ends: 262 [2020-09-04 13:24:57,408 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:24:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-09-04 13:24:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-09-04 13:24:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-09-04 13:24:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2020-09-04 13:24:57,420 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2020-09-04 13:24:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,421 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2020-09-04 13:24:57,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2020-09-04 13:24:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:24:57,423 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,423 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:24:57,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:24:57,424 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2020-09-04 13:24:57,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092662399] [2020-09-04 13:24:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,452 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:24:57,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092662399] [2020-09-04 13:24:57,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079491156] [2020-09-04 13:24:57,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,455 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2020-09-04 13:24:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,476 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2020-09-04 13:24:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:24:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,480 INFO L225 Difference]: With dead ends: 476 [2020-09-04 13:24:57,480 INFO L226 Difference]: Without dead ends: 474 [2020-09-04 13:24:57,481 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:24:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-09-04 13:24:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2020-09-04 13:24:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-09-04 13:24:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2020-09-04 13:24:57,495 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2020-09-04 13:24:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,495 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2020-09-04 13:24:57,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2020-09-04 13:24:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:24:57,497 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,497 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:24:57,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:24:57,498 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,498 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2020-09-04 13:24:57,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908557776] [2020-09-04 13:24:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,526 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:24:57,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908557776] [2020-09-04 13:24:57,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528714439] [2020-09-04 13:24:57,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,529 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2020-09-04 13:24:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,557 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2020-09-04 13:24:57,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:24:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,561 INFO L225 Difference]: With dead ends: 844 [2020-09-04 13:24:57,561 INFO L226 Difference]: Without dead ends: 498 [2020-09-04 13:24:57,562 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:24:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-09-04 13:24:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2020-09-04 13:24:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-09-04 13:24:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2020-09-04 13:24:57,581 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2020-09-04 13:24:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,581 INFO L479 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2020-09-04 13:24:57,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2020-09-04 13:24:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:24:57,583 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,583 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, 1] [2020-09-04 13:24:57,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:24:57,584 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,584 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2020-09-04 13:24:57,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938636352] [2020-09-04 13:24:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,613 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:24:57,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938636352] [2020-09-04 13:24:57,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539470869] [2020-09-04 13:24:57,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,616 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2020-09-04 13:24:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,638 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2020-09-04 13:24:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:24:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,643 INFO L225 Difference]: With dead ends: 744 [2020-09-04 13:24:57,643 INFO L226 Difference]: Without dead ends: 506 [2020-09-04 13:24:57,644 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:24:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-09-04 13:24:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2020-09-04 13:24:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-09-04 13:24:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2020-09-04 13:24:57,664 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2020-09-04 13:24:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,665 INFO L479 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2020-09-04 13:24:57,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2020-09-04 13:24:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:24:57,667 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,667 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, 1] [2020-09-04 13:24:57,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:24:57,668 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2020-09-04 13:24:57,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939208040] [2020-09-04 13:24:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,705 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:24:57,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939208040] [2020-09-04 13:24:57,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788395373] [2020-09-04 13:24:57,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,716 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2020-09-04 13:24:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,762 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2020-09-04 13:24:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:24:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,769 INFO L225 Difference]: With dead ends: 908 [2020-09-04 13:24:57,769 INFO L226 Difference]: Without dead ends: 906 [2020-09-04 13:24:57,770 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:24:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-09-04 13:24:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2020-09-04 13:24:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-09-04 13:24:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2020-09-04 13:24:57,799 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2020-09-04 13:24:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,800 INFO L479 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2020-09-04 13:24:57,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2020-09-04 13:24:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:24:57,802 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,802 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, 1] [2020-09-04 13:24:57,802 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:24:57,802 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2020-09-04 13:24:57,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995205489] [2020-09-04 13:24:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,846 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:24:57,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995205489] [2020-09-04 13:24:57,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917852588] [2020-09-04 13:24:57,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,850 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2020-09-04 13:24:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,886 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2020-09-04 13:24:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:24:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,892 INFO L225 Difference]: With dead ends: 1660 [2020-09-04 13:24:57,892 INFO L226 Difference]: Without dead ends: 970 [2020-09-04 13:24:57,895 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:24:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2020-09-04 13:24:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2020-09-04 13:24:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2020-09-04 13:24:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2020-09-04 13:24:57,931 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2020-09-04 13:24:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,931 INFO L479 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2020-09-04 13:24:57,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2020-09-04 13:24:57,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:24:57,933 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,933 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, 1, 1] [2020-09-04 13:24:57,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:24:57,934 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2020-09-04 13:24:57,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196410445] [2020-09-04 13:24:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,978 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:24:57,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196410445] [2020-09-04 13:24:57,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697628530] [2020-09-04 13:24:57,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,982 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2020-09-04 13:24:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,024 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2020-09-04 13:24:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:24:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,030 INFO L225 Difference]: With dead ends: 1452 [2020-09-04 13:24:58,030 INFO L226 Difference]: Without dead ends: 986 [2020-09-04 13:24:58,032 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:24:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-09-04 13:24:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2020-09-04 13:24:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-09-04 13:24:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2020-09-04 13:24:58,062 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2020-09-04 13:24:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,063 INFO L479 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2020-09-04 13:24:58,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2020-09-04 13:24:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:24:58,065 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,065 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, 1, 1] [2020-09-04 13:24:58,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:24:58,065 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2020-09-04 13:24:58,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803530789] [2020-09-04 13:24:58,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,092 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:24:58,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803530789] [2020-09-04 13:24:58,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318229781] [2020-09-04 13:24:58,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,094 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2020-09-04 13:24:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,130 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2020-09-04 13:24:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:24:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,139 INFO L225 Difference]: With dead ends: 1740 [2020-09-04 13:24:58,139 INFO L226 Difference]: Without dead ends: 1738 [2020-09-04 13:24:58,140 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:24:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-09-04 13:24:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2020-09-04 13:24:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2020-09-04 13:24:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2020-09-04 13:24:58,184 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2020-09-04 13:24:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,184 INFO L479 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2020-09-04 13:24:58,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2020-09-04 13:24:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:24:58,187 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,188 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, 1, 1] [2020-09-04 13:24:58,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:24:58,188 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2020-09-04 13:24:58,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650350180] [2020-09-04 13:24:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,215 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:24:58,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650350180] [2020-09-04 13:24:58,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762174816] [2020-09-04 13:24:58,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,217 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2020-09-04 13:24:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,264 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2020-09-04 13:24:58,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:24:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,274 INFO L225 Difference]: With dead ends: 3276 [2020-09-04 13:24:58,274 INFO L226 Difference]: Without dead ends: 1898 [2020-09-04 13:24:58,279 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:24:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-09-04 13:24:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2020-09-04 13:24:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2020-09-04 13:24:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2020-09-04 13:24:58,340 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2020-09-04 13:24:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,341 INFO L479 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2020-09-04 13:24:58,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2020-09-04 13:24:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:24:58,345 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,345 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, 1, 1, 1] [2020-09-04 13:24:58,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:24:58,346 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2020-09-04 13:24:58,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036298738] [2020-09-04 13:24:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,390 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:24:58,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036298738] [2020-09-04 13:24:58,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089397809] [2020-09-04 13:24:58,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,395 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2020-09-04 13:24:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,457 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2020-09-04 13:24:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:24:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,471 INFO L225 Difference]: With dead ends: 2844 [2020-09-04 13:24:58,472 INFO L226 Difference]: Without dead ends: 1930 [2020-09-04 13:24:58,475 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:24:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-09-04 13:24:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2020-09-04 13:24:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2020-09-04 13:24:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2020-09-04 13:24:58,553 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2020-09-04 13:24:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,553 INFO L479 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2020-09-04 13:24:58,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2020-09-04 13:24:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:24:58,557 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,558 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, 1, 1, 1] [2020-09-04 13:24:58,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:24:58,558 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2020-09-04 13:24:58,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085901241] [2020-09-04 13:24:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,599 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:24:58,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085901241] [2020-09-04 13:24:58,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917448046] [2020-09-04 13:24:58,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,604 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2020-09-04 13:24:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,701 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2020-09-04 13:24:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:24:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,717 INFO L225 Difference]: With dead ends: 3340 [2020-09-04 13:24:58,718 INFO L226 Difference]: Without dead ends: 3338 [2020-09-04 13:24:58,720 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:24:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-09-04 13:24:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2020-09-04 13:24:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2020-09-04 13:24:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2020-09-04 13:24:58,808 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2020-09-04 13:24:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,808 INFO L479 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2020-09-04 13:24:58,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2020-09-04 13:24:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:24:58,814 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,814 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, 1, 1, 1] [2020-09-04 13:24:58,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 13:24:58,814 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2020-09-04 13:24:58,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173671472] [2020-09-04 13:24:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,843 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:24:58,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173671472] [2020-09-04 13:24:58,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763867418] [2020-09-04 13:24:58,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,845 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2020-09-04 13:24:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,923 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2020-09-04 13:24:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:24:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,942 INFO L225 Difference]: With dead ends: 6476 [2020-09-04 13:24:58,942 INFO L226 Difference]: Without dead ends: 3722 [2020-09-04 13:24:58,950 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:24:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-09-04 13:24:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2020-09-04 13:24:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2020-09-04 13:24:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2020-09-04 13:24:59,089 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2020-09-04 13:24:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:59,090 INFO L479 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2020-09-04 13:24:59,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2020-09-04 13:24:59,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:24:59,095 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:59,095 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, 1, 1, 1, 1] [2020-09-04 13:24:59,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:24:59,099 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:59,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:59,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2020-09-04 13:24:59,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:59,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278327728] [2020-09-04 13:24:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,134 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:24:59,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278327728] [2020-09-04 13:24:59,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:59,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:59,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180917664] [2020-09-04 13:24:59,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:59,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:59,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:59,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:59,137 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2020-09-04 13:24:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:59,239 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2020-09-04 13:24:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:59,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-04 13:24:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:59,256 INFO L225 Difference]: With dead ends: 5580 [2020-09-04 13:24:59,257 INFO L226 Difference]: Without dead ends: 3786 [2020-09-04 13:24:59,262 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:24:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2020-09-04 13:24:59,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2020-09-04 13:24:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2020-09-04 13:24:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2020-09-04 13:24:59,379 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2020-09-04 13:24:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:59,379 INFO L479 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2020-09-04 13:24:59,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2020-09-04 13:24:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:24:59,385 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:59,385 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, 1, 1, 1, 1] [2020-09-04 13:24:59,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 13:24:59,386 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:59,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:59,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2020-09-04 13:24:59,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:59,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612087438] [2020-09-04 13:24:59,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,420 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:24:59,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612087438] [2020-09-04 13:24:59,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:59,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:59,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184712224] [2020-09-04 13:24:59,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:59,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:59,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:59,422 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2020-09-04 13:24:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:59,542 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2020-09-04 13:24:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:59,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-04 13:24:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:59,587 INFO L225 Difference]: With dead ends: 10956 [2020-09-04 13:24:59,587 INFO L226 Difference]: Without dead ends: 7306 [2020-09-04 13:24:59,598 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:24:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2020-09-04 13:24:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2020-09-04 13:24:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-09-04 13:24:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2020-09-04 13:24:59,829 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2020-09-04 13:24:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:59,829 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2020-09-04 13:24:59,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2020-09-04 13:24:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:24:59,883 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:59,883 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, 1, 1, 1, 1] [2020-09-04 13:24:59,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 13:24:59,884 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2020-09-04 13:24:59,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:59,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79929304] [2020-09-04 13:24:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,924 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:24:59,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79929304] [2020-09-04 13:24:59,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:59,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:59,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621061466] [2020-09-04 13:24:59,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:59,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:59,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:59,928 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2020-09-04 13:25:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:00,058 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2020-09-04 13:25:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:00,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-04 13:25:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:00,078 INFO L225 Difference]: With dead ends: 8076 [2020-09-04 13:25:00,079 INFO L226 Difference]: Without dead ends: 8074 [2020-09-04 13:25:00,083 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:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-09-04 13:25:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2020-09-04 13:25:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-09-04 13:25:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2020-09-04 13:25:00,282 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2020-09-04 13:25:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:00,282 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2020-09-04 13:25:00,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2020-09-04 13:25:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:00,292 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:00,292 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, 1, 1, 1, 1, 1] [2020-09-04 13:25:00,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 13:25:00,292 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2020-09-04 13:25:00,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:00,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531838527] [2020-09-04 13:25:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,344 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:00,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531838527] [2020-09-04 13:25:00,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:00,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:00,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577310373] [2020-09-04 13:25:00,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:00,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:00,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:00,346 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2020-09-04 13:25:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:00,558 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2020-09-04 13:25:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:00,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-09-04 13:25:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:00,583 INFO L225 Difference]: With dead ends: 12172 [2020-09-04 13:25:00,583 INFO L226 Difference]: Without dead ends: 12170 [2020-09-04 13:25:00,586 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:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2020-09-04 13:25:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2020-09-04 13:25:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2020-09-04 13:25:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2020-09-04 13:25:00,824 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2020-09-04 13:25:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:00,824 INFO L479 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2020-09-04 13:25:00,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2020-09-04 13:25:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:00,842 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:00,842 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, 1, 1, 1, 1, 1] [2020-09-04 13:25:00,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 13:25:00,843 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:00,843 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2020-09-04 13:25:00,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:00,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817527387] [2020-09-04 13:25:00,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,875 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:00,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817527387] [2020-09-04 13:25:00,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:00,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:00,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499059470] [2020-09-04 13:25:00,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:00,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:00,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:00,877 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2020-09-04 13:25:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:01,093 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2020-09-04 13:25:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:01,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-09-04 13:25:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:01,124 INFO L225 Difference]: With dead ends: 25228 [2020-09-04 13:25:01,124 INFO L226 Difference]: Without dead ends: 14218 [2020-09-04 13:25:01,237 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:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2020-09-04 13:25:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2020-09-04 13:25:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2020-09-04 13:25:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2020-09-04 13:25:01,554 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2020-09-04 13:25:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:01,555 INFO L479 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2020-09-04 13:25:01,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2020-09-04 13:25:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 13:25:01,573 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:01,573 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, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:01,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 13:25:01,574 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2020-09-04 13:25:01,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:01,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291657230] [2020-09-04 13:25:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:01,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:01,600 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:01,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291657230] [2020-09-04 13:25:01,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:01,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:01,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630056381] [2020-09-04 13:25:01,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:01,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:01,602 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2020-09-04 13:25:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:01,885 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2020-09-04 13:25:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:01,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-09-04 13:25:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:01,912 INFO L225 Difference]: With dead ends: 21516 [2020-09-04 13:25:01,913 INFO L226 Difference]: Without dead ends: 14602 [2020-09-04 13:25:01,928 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:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2020-09-04 13:25:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2020-09-04 13:25:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2020-09-04 13:25:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2020-09-04 13:25:02,218 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2020-09-04 13:25:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:02,219 INFO L479 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2020-09-04 13:25:02,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2020-09-04 13:25:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 13:25:02,240 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:02,240 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, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:02,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 13:25:02,240 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:02,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2020-09-04 13:25:02,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:02,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821129861] [2020-09-04 13:25:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:02,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:02,270 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:02,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821129861] [2020-09-04 13:25:02,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:02,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:02,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434388563] [2020-09-04 13:25:02,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:02,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:02,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:02,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:02,272 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2020-09-04 13:25:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:02,528 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2020-09-04 13:25:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:02,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-09-04 13:25:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:03,053 INFO L225 Difference]: With dead ends: 23562 [2020-09-04 13:25:03,054 INFO L226 Difference]: Without dead ends: 23560 [2020-09-04 13:25:03,061 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:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2020-09-04 13:25:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2020-09-04 13:25:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2020-09-04 13:25:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2020-09-04 13:25:03,417 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2020-09-04 13:25:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:03,418 INFO L479 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2020-09-04 13:25:03,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2020-09-04 13:25:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 13:25:03,453 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:03,453 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, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:03,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-04 13:25:03,454 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2020-09-04 13:25:03,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:03,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784512913] [2020-09-04 13:25:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:03,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:03,480 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:03,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784512913] [2020-09-04 13:25:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857617362] [2020-09-04 13:25:03,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:03,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:03,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:03,482 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2020-09-04 13:25:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:03,902 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2020-09-04 13:25:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:03,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-09-04 13:25:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:03,903 INFO L225 Difference]: With dead ends: 50184 [2020-09-04 13:25:03,903 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:25:03,967 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:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:25:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:25:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:25:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:25:03,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-09-04 13:25:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:03,968 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:25:03,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:25:03,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:25:03,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-04 13:25:03,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:25:04,006 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 13:25:04,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:04,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:04,007 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 13:25:04,007 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:25:04,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:25:04,007 INFO L271 CegarLoopResult]: At program point L159(lines 5 163) the Hoare annotation is: true [2020-09-04 13:25:04,008 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2020-09-04 13:25:04,008 INFO L268 CegarLoopResult]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,008 INFO L268 CegarLoopResult]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,008 INFO L268 CegarLoopResult]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,008 INFO L268 CegarLoopResult]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,008 INFO L268 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-09-04 13:25:04,008 INFO L268 CegarLoopResult]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,009 INFO L268 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2020-09-04 13:25:04,010 INFO L268 CegarLoopResult]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,010 INFO L268 CegarLoopResult]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,010 INFO L268 CegarLoopResult]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,010 INFO L271 CegarLoopResult]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2020-09-04 13:25:04,010 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2020-09-04 13:25:04,010 INFO L268 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2020-09-04 13:25:04,011 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2020-09-04 13:25:04,011 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2020-09-04 13:25:04,011 INFO L268 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2020-09-04 13:25:04,011 INFO L264 CegarLoopResult]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2020-09-04 13:25:04,011 INFO L268 CegarLoopResult]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,011 INFO L268 CegarLoopResult]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,011 INFO L268 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2020-09-04 13:25:04,011 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-09-04 13:25:04,011 INFO L268 CegarLoopResult]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,012 INFO L268 CegarLoopResult]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,012 INFO L268 CegarLoopResult]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,012 INFO L268 CegarLoopResult]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,012 INFO L268 CegarLoopResult]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,012 INFO L268 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2020-09-04 13:25:04,012 INFO L268 CegarLoopResult]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,012 INFO L268 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2020-09-04 13:25:04,012 INFO L268 CegarLoopResult]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,013 INFO L268 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2020-09-04 13:25:04,013 INFO L268 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-09-04 13:25:04,013 INFO L268 CegarLoopResult]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,013 INFO L268 CegarLoopResult]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2020-09-04 13:25:04,013 INFO L268 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2020-09-04 13:25:04,013 INFO L268 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-09-04 13:25:04,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:25:04 BoogieIcfgContainer [2020-09-04 13:25:04,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:25:04,036 INFO L168 Benchmark]: Toolchain (without parser) took 9093.12 ms. Allocated memory was 140.5 MB in the beginning and 655.4 MB in the end (delta: 514.9 MB). Free memory was 104.1 MB in the beginning and 458.4 MB in the end (delta: -354.3 MB). Peak memory consumption was 160.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:04,038 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:25:04,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.63 ms. Allocated memory is still 140.5 MB. Free memory was 103.9 MB in the beginning and 92.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:04,043 INFO L168 Benchmark]: Boogie Preprocessor took 127.57 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.7 MB in the beginning and 181.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:04,043 INFO L168 Benchmark]: RCFGBuilder took 404.62 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 161.7 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:04,044 INFO L168 Benchmark]: TraceAbstraction took 8179.93 ms. Allocated memory was 203.4 MB in the beginning and 655.4 MB in the end (delta: 451.9 MB). Free memory was 161.1 MB in the beginning and 458.4 MB in the end (delta: -297.4 MB). Peak memory consumption was 154.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:04,049 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 374.63 ms. Allocated memory is still 140.5 MB. Free memory was 103.9 MB in the beginning and 92.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.57 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.7 MB in the beginning and 181.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 404.62 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 161.7 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8179.93 ms. Allocated memory was 203.4 MB in the beginning and 655.4 MB in the end (delta: 451.9 MB). Free memory was 161.1 MB in the beginning and 458.4 MB in the end (delta: -297.4 MB). Peak memory consumption was 154.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.9s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...