/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:19:57,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:19:57,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:19:57,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:19:57,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:19:57,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:19:57,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:19:57,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:19:57,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:19:57,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:19:57,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:19:57,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:19:57,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:19:57,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:19:57,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:19:57,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:19:57,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:19:57,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:19:57,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:19:57,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:19:57,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:19:57,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:19:57,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:19:57,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:19:57,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:19:57,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:19:57,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:19:57,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:19:57,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:19:57,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:19:57,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:19:57,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:19:57,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:19:57,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:19:57,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:19:57,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:19:57,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:19:57,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:19:57,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:19:57,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:19:57,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:19:57,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:19:57,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:19:57,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:19:57,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:19:57,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:19:57,862 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:19:57,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:19:57,862 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:19:57,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:19:57,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:19:57,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:19:57,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:19:57,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:19:57,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:19:57,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:19:57,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:19:57,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:19:57,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:19:57,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:19:57,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:19:57,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:19:57,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:19:57,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:19:57,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:19:57,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:19:57,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:19:57,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:19:57,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:19:57,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:19:57,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:19:58,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:19:58,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:19:58,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:19:58,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:19:58,191 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:19:58,191 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-11-06 21:19:58,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bb2f98c/ebc302fca8954810ba72d6024e044cce/FLAG5c1aa0d99 [2019-11-06 21:19:58,740 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:19:58,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-11-06 21:19:58,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bb2f98c/ebc302fca8954810ba72d6024e044cce/FLAG5c1aa0d99 [2019-11-06 21:19:59,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bb2f98c/ebc302fca8954810ba72d6024e044cce [2019-11-06 21:19:59,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:19:59,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:19:59,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:19:59,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:19:59,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:19:59,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9db9be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59, skipping insertion in model container [2019-11-06 21:19:59,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,125 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:19:59,150 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:19:59,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:19:59,375 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:19:59,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:19:59,439 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:19:59,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59 WrapperNode [2019-11-06 21:19:59,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:19:59,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:19:59,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:19:59,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:19:59,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (1/1) ... [2019-11-06 21:19:59,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:19:59,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:19:59,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:19:59,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:19:59,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:19:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:19:59,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:19:59,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:19:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:19:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:19:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:19:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:19:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:19:59,991 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:19:59,995 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:19:59,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:59 BoogieIcfgContainer [2019-11-06 21:19:59,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:19:59,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:19:59,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:20:00,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:20:00,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:19:59" (1/3) ... [2019-11-06 21:20:00,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4d108a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:20:00, skipping insertion in model container [2019-11-06 21:20:00,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:59" (2/3) ... [2019-11-06 21:20:00,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4d108a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:20:00, skipping insertion in model container [2019-11-06 21:20:00,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:59" (3/3) ... [2019-11-06 21:20:00,013 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-11-06 21:20:00,026 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:20:00,034 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:20:00,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:20:00,070 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:20:00,071 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:20:00,071 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:20:00,071 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:20:00,071 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:20:00,071 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:20:00,071 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:20:00,072 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:20:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-06 21:20:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:20:00,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:00,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:00,100 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-11-06 21:20:00,116 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:00,116 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605817720] [2019-11-06 21:20:00,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:00,299 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605817720] [2019-11-06 21:20:00,300 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:00,300 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:00,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162896304] [2019-11-06 21:20:00,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:00,307 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:00,319 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-11-06 21:20:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:00,387 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-11-06 21:20:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:00,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-06 21:20:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:00,398 INFO L225 Difference]: With dead ends: 63 [2019-11-06 21:20:00,398 INFO L226 Difference]: Without dead ends: 48 [2019-11-06 21:20:00,402 INFO L630 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 [2019-11-06 21:20:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-06 21:20:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-11-06 21:20:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-06 21:20:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-11-06 21:20:00,445 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-11-06 21:20:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-11-06 21:20:00,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-11-06 21:20:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:20:00,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:00,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:00,448 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-11-06 21:20:00,449 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:00,450 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323922661] [2019-11-06 21:20:00,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:00,496 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323922661] [2019-11-06 21:20:00,496 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:00,497 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:00,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312189882] [2019-11-06 21:20:00,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:00,499 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:00,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:00,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:00,500 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-11-06 21:20:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:00,527 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-11-06 21:20:00,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:00,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-06 21:20:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:00,530 INFO L225 Difference]: With dead ends: 77 [2019-11-06 21:20:00,530 INFO L226 Difference]: Without dead ends: 48 [2019-11-06 21:20:00,531 INFO L630 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 [2019-11-06 21:20:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-06 21:20:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-11-06 21:20:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 21:20:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-11-06 21:20:00,541 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-11-06 21:20:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:00,541 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-11-06 21:20:00,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-11-06 21:20:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:20:00,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:00,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:00,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-11-06 21:20:00,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:00,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916831854] [2019-11-06 21:20:00,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:00,586 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916831854] [2019-11-06 21:20:00,586 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:00,586 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:00,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793855876] [2019-11-06 21:20:00,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:00,587 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:00,588 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-11-06 21:20:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:00,624 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-11-06 21:20:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:00,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-06 21:20:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:00,626 INFO L225 Difference]: With dead ends: 72 [2019-11-06 21:20:00,626 INFO L226 Difference]: Without dead ends: 51 [2019-11-06 21:20:00,627 INFO L630 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 [2019-11-06 21:20:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-06 21:20:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-11-06 21:20:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-06 21:20:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-11-06 21:20:00,636 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-11-06 21:20:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:00,637 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-11-06 21:20:00,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-11-06 21:20:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:20:00,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:00,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:00,639 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-11-06 21:20:00,640 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:00,640 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133984105] [2019-11-06 21:20:00,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:00,684 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133984105] [2019-11-06 21:20:00,684 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:00,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:00,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971585014] [2019-11-06 21:20:00,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:00,685 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:00,686 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-11-06 21:20:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:00,712 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-11-06 21:20:00,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:00,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-06 21:20:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:00,715 INFO L225 Difference]: With dead ends: 88 [2019-11-06 21:20:00,715 INFO L226 Difference]: Without dead ends: 86 [2019-11-06 21:20:00,716 INFO L630 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 [2019-11-06 21:20:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-06 21:20:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-11-06 21:20:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-06 21:20:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-11-06 21:20:00,735 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-11-06 21:20:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:00,736 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-11-06 21:20:00,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-11-06 21:20:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:20:00,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:00,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:00,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:00,739 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-11-06 21:20:00,739 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:00,739 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068603182] [2019-11-06 21:20:00,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:00,803 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068603182] [2019-11-06 21:20:00,804 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:00,804 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:00,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120368307] [2019-11-06 21:20:00,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:00,805 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:00,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:00,806 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-11-06 21:20:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:00,840 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-11-06 21:20:00,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:00,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-06 21:20:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:00,844 INFO L225 Difference]: With dead ends: 144 [2019-11-06 21:20:00,844 INFO L226 Difference]: Without dead ends: 88 [2019-11-06 21:20:00,847 INFO L630 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 [2019-11-06 21:20:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-06 21:20:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-06 21:20:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-06 21:20:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-11-06 21:20:00,869 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-11-06 21:20:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:00,870 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-11-06 21:20:00,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-11-06 21:20:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:20:00,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:00,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:00,874 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-11-06 21:20:00,874 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:00,875 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725004229] [2019-11-06 21:20:00,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:00,912 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725004229] [2019-11-06 21:20:00,913 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:00,913 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:00,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459016403] [2019-11-06 21:20:00,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:00,914 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:00,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:00,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:00,915 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-11-06 21:20:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:00,933 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-11-06 21:20:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:00,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 21:20:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:00,935 INFO L225 Difference]: With dead ends: 129 [2019-11-06 21:20:00,936 INFO L226 Difference]: Without dead ends: 90 [2019-11-06 21:20:00,936 INFO L630 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 [2019-11-06 21:20:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-06 21:20:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-06 21:20:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-06 21:20:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-11-06 21:20:00,946 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-11-06 21:20:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:00,947 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-11-06 21:20:00,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-11-06 21:20:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:20:00,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:00,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:00,949 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-11-06 21:20:00,950 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:00,950 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918252281] [2019-11-06 21:20:00,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:00,989 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918252281] [2019-11-06 21:20:00,989 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:00,989 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:00,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87503475] [2019-11-06 21:20:00,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:00,990 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:00,992 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-11-06 21:20:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,029 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-11-06 21:20:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 21:20:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,032 INFO L225 Difference]: With dead ends: 156 [2019-11-06 21:20:01,033 INFO L226 Difference]: Without dead ends: 154 [2019-11-06 21:20:01,034 INFO L630 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 [2019-11-06 21:20:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-06 21:20:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-11-06 21:20:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-06 21:20:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-11-06 21:20:01,051 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-11-06 21:20:01,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,051 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-11-06 21:20:01,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-11-06 21:20:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:20:01,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-11-06 21:20:01,059 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,059 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672446404] [2019-11-06 21:20:01,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,105 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672446404] [2019-11-06 21:20:01,106 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,106 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537648730] [2019-11-06 21:20:01,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,107 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,108 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-11-06 21:20:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,142 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-11-06 21:20:01,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 21:20:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,145 INFO L225 Difference]: With dead ends: 272 [2019-11-06 21:20:01,145 INFO L226 Difference]: Without dead ends: 162 [2019-11-06 21:20:01,149 INFO L630 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 [2019-11-06 21:20:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-06 21:20:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-11-06 21:20:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-06 21:20:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-11-06 21:20:01,182 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-11-06 21:20:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,183 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-11-06 21:20:01,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-11-06 21:20:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:01,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-11-06 21:20:01,188 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,189 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499985745] [2019-11-06 21:20:01,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,236 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499985745] [2019-11-06 21:20:01,237 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,237 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208372498] [2019-11-06 21:20:01,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,238 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,239 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-11-06 21:20:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,266 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-11-06 21:20:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,268 INFO L225 Difference]: With dead ends: 240 [2019-11-06 21:20:01,268 INFO L226 Difference]: Without dead ends: 166 [2019-11-06 21:20:01,269 INFO L630 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 [2019-11-06 21:20:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-06 21:20:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-11-06 21:20:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-06 21:20:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-11-06 21:20:01,285 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-11-06 21:20:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,285 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-11-06 21:20:01,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-11-06 21:20:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:01,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,287 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-11-06 21:20:01,288 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,288 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328336659] [2019-11-06 21:20:01,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,344 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328336659] [2019-11-06 21:20:01,344 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,344 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209285522] [2019-11-06 21:20:01,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,347 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,348 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-11-06 21:20:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,386 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-11-06 21:20:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,388 INFO L225 Difference]: With dead ends: 284 [2019-11-06 21:20:01,388 INFO L226 Difference]: Without dead ends: 282 [2019-11-06 21:20:01,392 INFO L630 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 [2019-11-06 21:20:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-06 21:20:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-11-06 21:20:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-06 21:20:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-11-06 21:20:01,413 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-11-06 21:20:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,413 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-11-06 21:20:01,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-11-06 21:20:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:01,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,415 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-11-06 21:20:01,418 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,418 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686821921] [2019-11-06 21:20:01,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,451 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686821921] [2019-11-06 21:20:01,451 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,451 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072698516] [2019-11-06 21:20:01,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,452 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,454 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-11-06 21:20:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,496 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-11-06 21:20:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,501 INFO L225 Difference]: With dead ends: 524 [2019-11-06 21:20:01,501 INFO L226 Difference]: Without dead ends: 306 [2019-11-06 21:20:01,504 INFO L630 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 [2019-11-06 21:20:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-06 21:20:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-11-06 21:20:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-06 21:20:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-11-06 21:20:01,537 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-11-06 21:20:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,537 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-11-06 21:20:01,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-11-06 21:20:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:01,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,543 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-11-06 21:20:01,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067097850] [2019-11-06 21:20:01,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,583 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067097850] [2019-11-06 21:20:01,584 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,584 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416107352] [2019-11-06 21:20:01,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,585 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,587 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-11-06 21:20:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,612 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-11-06 21:20:01,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,616 INFO L225 Difference]: With dead ends: 456 [2019-11-06 21:20:01,617 INFO L226 Difference]: Without dead ends: 314 [2019-11-06 21:20:01,617 INFO L630 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 [2019-11-06 21:20:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-06 21:20:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-11-06 21:20:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-06 21:20:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-11-06 21:20:01,633 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-11-06 21:20:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,634 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-11-06 21:20:01,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-11-06 21:20:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:01,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,636 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-11-06 21:20:01,636 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,636 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606959493] [2019-11-06 21:20:01,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,666 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606959493] [2019-11-06 21:20:01,666 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,666 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062591776] [2019-11-06 21:20:01,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,667 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,668 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-11-06 21:20:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,687 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-11-06 21:20:01,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,690 INFO L225 Difference]: With dead ends: 524 [2019-11-06 21:20:01,691 INFO L226 Difference]: Without dead ends: 522 [2019-11-06 21:20:01,691 INFO L630 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 [2019-11-06 21:20:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-06 21:20:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-11-06 21:20:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-06 21:20:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-11-06 21:20:01,707 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-11-06 21:20:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,707 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-11-06 21:20:01,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-11-06 21:20:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:01,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,715 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-11-06 21:20:01,716 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,716 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195681281] [2019-11-06 21:20:01,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,741 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195681281] [2019-11-06 21:20:01,741 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,741 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585906262] [2019-11-06 21:20:01,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,742 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,743 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-11-06 21:20:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,773 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-11-06 21:20:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,778 INFO L225 Difference]: With dead ends: 1020 [2019-11-06 21:20:01,778 INFO L226 Difference]: Without dead ends: 586 [2019-11-06 21:20:01,780 INFO L630 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 [2019-11-06 21:20:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-06 21:20:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-11-06 21:20:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-06 21:20:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-11-06 21:20:01,800 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-11-06 21:20:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,801 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-11-06 21:20:01,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-11-06 21:20:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:01,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,805 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-11-06 21:20:01,805 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,805 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776211897] [2019-11-06 21:20:01,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776211897] [2019-11-06 21:20:01,839 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,839 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819731987] [2019-11-06 21:20:01,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,840 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,841 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-11-06 21:20:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,867 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-11-06 21:20:01,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:01,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,872 INFO L225 Difference]: With dead ends: 876 [2019-11-06 21:20:01,872 INFO L226 Difference]: Without dead ends: 602 [2019-11-06 21:20:01,874 INFO L630 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 [2019-11-06 21:20:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-06 21:20:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-11-06 21:20:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-06 21:20:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-11-06 21:20:01,895 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-11-06 21:20:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:01,895 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-11-06 21:20:01,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-11-06 21:20:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:01,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:01,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:01,897 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:01,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-11-06 21:20:01,898 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:01,898 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792160923] [2019-11-06 21:20:01,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:01,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792160923] [2019-11-06 21:20:01,928 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:01,928 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:01,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109357089] [2019-11-06 21:20:01,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:01,929 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:01,929 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-11-06 21:20:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:01,963 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-11-06 21:20:01,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:01,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:01,969 INFO L225 Difference]: With dead ends: 970 [2019-11-06 21:20:01,969 INFO L226 Difference]: Without dead ends: 968 [2019-11-06 21:20:01,970 INFO L630 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 [2019-11-06 21:20:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-11-06 21:20:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-11-06 21:20:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-11-06 21:20:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-11-06 21:20:02,001 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-11-06 21:20:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:02,002 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-11-06 21:20:02,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-11-06 21:20:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:02,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:02,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:02,005 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-11-06 21:20:02,006 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:02,006 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406015551] [2019-11-06 21:20:02,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:02,027 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406015551] [2019-11-06 21:20:02,027 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:02,027 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:02,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187480847] [2019-11-06 21:20:02,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:02,028 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:02,030 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-11-06 21:20:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:02,073 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-11-06 21:20:02,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:02,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:02,074 INFO L225 Difference]: With dead ends: 1992 [2019-11-06 21:20:02,074 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:20:02,079 INFO L630 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 [2019-11-06 21:20:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:20:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:20:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:20:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:20:02,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-06 21:20:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:02,080 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:20:02,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:20:02,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:20:02,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:20:02,106 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-06 21:20:02,106 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:20:02,106 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:20:02,106 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:20:02,106 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:20:02,107 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:20:02,107 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-06 21:20:02,107 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-11-06 21:20:02,107 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,107 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-06 21:20:02,107 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-11-06 21:20:02,108 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-11-06 21:20:02,108 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,108 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,108 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,108 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-06 21:20:02,108 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-11-06 21:20:02,109 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,109 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-11-06 21:20:02,109 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-06 21:20:02,109 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,109 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-11-06 21:20:02,110 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-11-06 21:20:02,110 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-06 21:20:02,110 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-06 21:20:02,110 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-11-06 21:20:02,110 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,110 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,110 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,111 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-06 21:20:02,111 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,111 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-11-06 21:20:02,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:20:02 BoogieIcfgContainer [2019-11-06 21:20:02,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:20:02,122 INFO L168 Benchmark]: Toolchain (without parser) took 3012.77 ms. Allocated memory was 137.4 MB in the beginning and 232.3 MB in the end (delta: 94.9 MB). Free memory was 101.6 MB in the beginning and 89.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:02,123 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 21:20:02,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.81 ms. Allocated memory is still 137.4 MB. Free memory was 101.4 MB in the beginning and 91.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:02,125 INFO L168 Benchmark]: Boogie Preprocessor took 141.61 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.3 MB in the beginning and 179.1 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:02,125 INFO L168 Benchmark]: RCFGBuilder took 410.16 ms. Allocated memory is still 201.3 MB. Free memory was 179.1 MB in the beginning and 164.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:02,126 INFO L168 Benchmark]: TraceAbstraction took 2120.97 ms. Allocated memory was 201.3 MB in the beginning and 232.3 MB in the end (delta: 30.9 MB). Free memory was 163.6 MB in the beginning and 89.0 MB in the end (delta: 74.7 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:02,130 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.81 ms. Allocated memory is still 137.4 MB. Free memory was 101.4 MB in the beginning and 91.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.61 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.3 MB in the beginning and 179.1 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 410.16 ms. Allocated memory is still 201.3 MB. Free memory was 179.1 MB in the beginning and 164.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2120.97 ms. Allocated memory was 201.3 MB in the beginning and 232.3 MB in the end (delta: 30.9 MB). Free memory was 163.6 MB in the beginning and 89.0 MB in the end (delta: 74.7 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 2.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...