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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:52,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:52,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:52,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:52,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:52,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:52,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:52,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:52,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:52,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:52,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:52,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:52,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:52,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:52,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:52,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:52,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:52,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:52,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:52,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:52,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:52,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:52,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:52,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:52,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:52,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:52,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:52,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:52,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:52,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:52,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:52,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:52,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:52,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:52,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:52,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:52,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:52,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:52,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:52,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:52,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:52,842 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:13:52,857 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:52,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:52,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:52,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:52,859 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:52,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:52,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:52,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:52,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:52,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:52,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:52,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:52,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:52,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:52,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:52,861 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:52,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:52,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:52,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:52,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:52,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:52,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:52,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:52,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:52,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:52,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:52,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:52,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:52,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:53,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:53,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:53,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:53,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:53,146 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:53,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-10-14 23:13:53,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df34d7fa/4cb6f458c45d46dcb5190beab5533d53/FLAG55e7cbaea [2019-10-14 23:13:53,676 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:53,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-10-14 23:13:53,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df34d7fa/4cb6f458c45d46dcb5190beab5533d53/FLAG55e7cbaea [2019-10-14 23:13:54,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df34d7fa/4cb6f458c45d46dcb5190beab5533d53 [2019-10-14 23:13:54,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:54,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:54,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:54,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:54,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:54,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d281660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54, skipping insertion in model container [2019-10-14 23:13:54,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,084 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:54,109 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:54,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:54,361 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:54,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:54,525 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:54,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54 WrapperNode [2019-10-14 23:13:54,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:54,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:54,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:54,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:54,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (1/1) ... [2019-10-14 23:13:54,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:54,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:54,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:54,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:54,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:54,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:54,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:54,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:54,930 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:54,931 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:54,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:54 BoogieIcfgContainer [2019-10-14 23:13:54,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:54,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:54,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:54,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:54,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:54" (1/3) ... [2019-10-14 23:13:54,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717a7774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:54, skipping insertion in model container [2019-10-14 23:13:54,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:54" (2/3) ... [2019-10-14 23:13:54,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717a7774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:54, skipping insertion in model container [2019-10-14 23:13:54,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:54" (3/3) ... [2019-10-14 23:13:54,956 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-10-14 23:13:54,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:54,973 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:54,986 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:55,015 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:55,015 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:55,015 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:55,015 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:55,015 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:55,016 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:55,016 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:55,016 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-14 23:13:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:55,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,041 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,043 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-10-14 23:13:55,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613648465] [2019-10-14 23:13:55,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613648465] [2019-10-14 23:13:55,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927563744] [2019-10-14 23:13:55,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,250 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-14 23:13:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,312 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2019-10-14 23:13:55,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,324 INFO L225 Difference]: With dead ends: 81 [2019-10-14 23:13:55,325 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:13:55,328 INFO L600 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-10-14 23:13:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:13:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-10-14 23:13:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:13:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-10-14 23:13:55,376 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-10-14 23:13:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,377 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-10-14 23:13:55,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-10-14 23:13:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:55,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,379 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,380 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-10-14 23:13:55,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638597896] [2019-10-14 23:13:55,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638597896] [2019-10-14 23:13:55,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805082089] [2019-10-14 23:13:55,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,445 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-10-14 23:13:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,473 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2019-10-14 23:13:55,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,476 INFO L225 Difference]: With dead ends: 107 [2019-10-14 23:13:55,476 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:13:55,478 INFO L600 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-10-14 23:13:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:13:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-14 23:13:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-14 23:13:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-10-14 23:13:55,493 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-10-14 23:13:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,495 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-10-14 23:13:55,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-10-14 23:13:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:55,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,497 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,498 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-10-14 23:13:55,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6465912] [2019-10-14 23:13:55,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6465912] [2019-10-14 23:13:55,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759222115] [2019-10-14 23:13:55,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,575 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-10-14 23:13:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,641 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2019-10-14 23:13:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,646 INFO L225 Difference]: With dead ends: 99 [2019-10-14 23:13:55,646 INFO L226 Difference]: Without dead ends: 69 [2019-10-14 23:13:55,647 INFO L600 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-10-14 23:13:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-14 23:13:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-14 23:13:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-14 23:13:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-10-14 23:13:55,665 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-10-14 23:13:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,666 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-10-14 23:13:55,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-10-14 23:13:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:55,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,667 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,668 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-10-14 23:13:55,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14275149] [2019-10-14 23:13:55,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14275149] [2019-10-14 23:13:55,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239576057] [2019-10-14 23:13:55,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,746 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-10-14 23:13:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,763 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2019-10-14 23:13:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,766 INFO L225 Difference]: With dead ends: 124 [2019-10-14 23:13:55,766 INFO L226 Difference]: Without dead ends: 122 [2019-10-14 23:13:55,766 INFO L600 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-10-14 23:13:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-14 23:13:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-10-14 23:13:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-14 23:13:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-10-14 23:13:55,776 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-10-14 23:13:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,777 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-10-14 23:13:55,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-10-14 23:13:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:55,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,778 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,779 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,779 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-10-14 23:13:55,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630007688] [2019-10-14 23:13:55,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630007688] [2019-10-14 23:13:55,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447023040] [2019-10-14 23:13:55,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,814 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-10-14 23:13:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,851 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2019-10-14 23:13:55,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,853 INFO L225 Difference]: With dead ends: 204 [2019-10-14 23:13:55,853 INFO L226 Difference]: Without dead ends: 124 [2019-10-14 23:13:55,854 INFO L600 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-10-14 23:13:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-14 23:13:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-14 23:13:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-14 23:13:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-10-14 23:13:55,866 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-10-14 23:13:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,867 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-10-14 23:13:55,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-10-14 23:13:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:55,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,868 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,869 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-10-14 23:13:55,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613803917] [2019-10-14 23:13:55,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613803917] [2019-10-14 23:13:55,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500880325] [2019-10-14 23:13:55,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,911 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-10-14 23:13:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,930 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2019-10-14 23:13:55,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,932 INFO L225 Difference]: With dead ends: 183 [2019-10-14 23:13:55,932 INFO L226 Difference]: Without dead ends: 126 [2019-10-14 23:13:55,933 INFO L600 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-10-14 23:13:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-14 23:13:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-10-14 23:13:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-14 23:13:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-10-14 23:13:55,944 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-10-14 23:13:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,944 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-10-14 23:13:55,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-10-14 23:13:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:55,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,946 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-10-14 23:13:55,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580574149] [2019-10-14 23:13:55,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580574149] [2019-10-14 23:13:55,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616548999] [2019-10-14 23:13:55,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,995 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-10-14 23:13:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,023 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2019-10-14 23:13:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,025 INFO L225 Difference]: With dead ends: 228 [2019-10-14 23:13:56,026 INFO L226 Difference]: Without dead ends: 226 [2019-10-14 23:13:56,026 INFO L600 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-10-14 23:13:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-14 23:13:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-10-14 23:13:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-14 23:13:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-10-14 23:13:56,040 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-10-14 23:13:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,040 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-10-14 23:13:56,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-10-14 23:13:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:56,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,042 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,042 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-10-14 23:13:56,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069002587] [2019-10-14 23:13:56,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069002587] [2019-10-14 23:13:56,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138956669] [2019-10-14 23:13:56,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,089 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-10-14 23:13:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,128 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2019-10-14 23:13:56,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,130 INFO L225 Difference]: With dead ends: 392 [2019-10-14 23:13:56,130 INFO L226 Difference]: Without dead ends: 234 [2019-10-14 23:13:56,133 INFO L600 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-10-14 23:13:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-14 23:13:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-10-14 23:13:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-14 23:13:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-10-14 23:13:56,148 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-10-14 23:13:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,149 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-10-14 23:13:56,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-10-14 23:13:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:56,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,151 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,151 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-10-14 23:13:56,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580771310] [2019-10-14 23:13:56,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580771310] [2019-10-14 23:13:56,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024447311] [2019-10-14 23:13:56,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,190 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-10-14 23:13:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,225 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2019-10-14 23:13:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,228 INFO L225 Difference]: With dead ends: 348 [2019-10-14 23:13:56,228 INFO L226 Difference]: Without dead ends: 238 [2019-10-14 23:13:56,228 INFO L600 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-10-14 23:13:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-14 23:13:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-10-14 23:13:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-14 23:13:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-10-14 23:13:56,249 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-10-14 23:13:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,249 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-10-14 23:13:56,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-10-14 23:13:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:56,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,258 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,258 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,259 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-10-14 23:13:56,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693032909] [2019-10-14 23:13:56,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693032909] [2019-10-14 23:13:56,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475387409] [2019-10-14 23:13:56,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,303 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-10-14 23:13:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,327 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2019-10-14 23:13:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,331 INFO L225 Difference]: With dead ends: 428 [2019-10-14 23:13:56,331 INFO L226 Difference]: Without dead ends: 426 [2019-10-14 23:13:56,332 INFO L600 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-10-14 23:13:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-14 23:13:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-10-14 23:13:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-14 23:13:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-10-14 23:13:56,345 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-10-14 23:13:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,347 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-10-14 23:13:56,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-10-14 23:13:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:56,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,352 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,352 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-10-14 23:13:56,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3172063] [2019-10-14 23:13:56,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3172063] [2019-10-14 23:13:56,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432856314] [2019-10-14 23:13:56,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,395 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-10-14 23:13:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,422 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2019-10-14 23:13:56,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,425 INFO L225 Difference]: With dead ends: 764 [2019-10-14 23:13:56,425 INFO L226 Difference]: Without dead ends: 450 [2019-10-14 23:13:56,426 INFO L600 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-10-14 23:13:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-14 23:13:56,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-10-14 23:13:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-14 23:13:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-10-14 23:13:56,442 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-10-14 23:13:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,442 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-10-14 23:13:56,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-10-14 23:13:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:56,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,444 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,444 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-10-14 23:13:56,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782686658] [2019-10-14 23:13:56,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782686658] [2019-10-14 23:13:56,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311358820] [2019-10-14 23:13:56,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,479 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-10-14 23:13:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,505 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2019-10-14 23:13:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,508 INFO L225 Difference]: With dead ends: 672 [2019-10-14 23:13:56,509 INFO L226 Difference]: Without dead ends: 458 [2019-10-14 23:13:56,509 INFO L600 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-10-14 23:13:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-14 23:13:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-10-14 23:13:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-14 23:13:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-10-14 23:13:56,528 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-10-14 23:13:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,529 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-10-14 23:13:56,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-10-14 23:13:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:56,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,533 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-10-14 23:13:56,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428967342] [2019-10-14 23:13:56,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428967342] [2019-10-14 23:13:56,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456468367] [2019-10-14 23:13:56,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,583 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-10-14 23:13:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,609 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2019-10-14 23:13:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,615 INFO L225 Difference]: With dead ends: 812 [2019-10-14 23:13:56,615 INFO L226 Difference]: Without dead ends: 810 [2019-10-14 23:13:56,616 INFO L600 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-10-14 23:13:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-10-14 23:13:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-10-14 23:13:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-14 23:13:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-10-14 23:13:56,637 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-10-14 23:13:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,637 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-10-14 23:13:56,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-10-14 23:13:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:56,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,640 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-10-14 23:13:56,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872253433] [2019-10-14 23:13:56,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872253433] [2019-10-14 23:13:56,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090755029] [2019-10-14 23:13:56,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,673 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-10-14 23:13:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,702 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2019-10-14 23:13:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,707 INFO L225 Difference]: With dead ends: 1500 [2019-10-14 23:13:56,707 INFO L226 Difference]: Without dead ends: 874 [2019-10-14 23:13:56,709 INFO L600 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-10-14 23:13:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-14 23:13:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-10-14 23:13:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-14 23:13:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-10-14 23:13:56,739 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-10-14 23:13:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,740 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-10-14 23:13:56,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-10-14 23:13:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:56,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,742 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,742 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-10-14 23:13:56,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363170530] [2019-10-14 23:13:56,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363170530] [2019-10-14 23:13:56,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460727583] [2019-10-14 23:13:56,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,769 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-10-14 23:13:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,794 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2019-10-14 23:13:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,800 INFO L225 Difference]: With dead ends: 1308 [2019-10-14 23:13:56,800 INFO L226 Difference]: Without dead ends: 890 [2019-10-14 23:13:56,801 INFO L600 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-10-14 23:13:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-10-14 23:13:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-10-14 23:13:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-14 23:13:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-10-14 23:13:56,836 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-10-14 23:13:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,836 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-10-14 23:13:56,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-10-14 23:13:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:56,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,839 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,839 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-10-14 23:13:56,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107194937] [2019-10-14 23:13:56,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107194937] [2019-10-14 23:13:56,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656552808] [2019-10-14 23:13:56,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,878 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-10-14 23:13:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,914 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2019-10-14 23:13:56,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,922 INFO L225 Difference]: With dead ends: 1548 [2019-10-14 23:13:56,922 INFO L226 Difference]: Without dead ends: 1546 [2019-10-14 23:13:56,923 INFO L600 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-10-14 23:13:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-14 23:13:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-10-14 23:13:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-10-14 23:13:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-10-14 23:13:56,963 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-10-14 23:13:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,964 INFO L462 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-10-14 23:13:56,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-10-14 23:13:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:56,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,967 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,967 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,968 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-10-14 23:13:56,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790751092] [2019-10-14 23:13:56,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790751092] [2019-10-14 23:13:56,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738561040] [2019-10-14 23:13:56,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,001 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-10-14 23:13:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,055 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2019-10-14 23:13:57,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,064 INFO L225 Difference]: With dead ends: 2956 [2019-10-14 23:13:57,064 INFO L226 Difference]: Without dead ends: 1706 [2019-10-14 23:13:57,068 INFO L600 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-10-14 23:13:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-10-14 23:13:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-10-14 23:13:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-10-14 23:13:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-10-14 23:13:57,143 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-10-14 23:13:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,144 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-10-14 23:13:57,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-10-14 23:13:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:57,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,148 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:57,149 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-10-14 23:13:57,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123136311] [2019-10-14 23:13:57,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:57,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123136311] [2019-10-14 23:13:57,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038031092] [2019-10-14 23:13:57,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,178 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-10-14 23:13:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,232 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2019-10-14 23:13:57,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,243 INFO L225 Difference]: With dead ends: 2556 [2019-10-14 23:13:57,244 INFO L226 Difference]: Without dead ends: 1738 [2019-10-14 23:13:57,246 INFO L600 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-10-14 23:13:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-14 23:13:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-10-14 23:13:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-10-14 23:13:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-10-14 23:13:57,308 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-10-14 23:13:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,308 INFO L462 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-10-14 23:13:57,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-10-14 23:13:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:57,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,311 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:57,312 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,312 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-10-14 23:13:57,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056653403] [2019-10-14 23:13:57,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:57,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056653403] [2019-10-14 23:13:57,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79915180] [2019-10-14 23:13:57,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,343 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-10-14 23:13:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,401 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2019-10-14 23:13:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,414 INFO L225 Difference]: With dead ends: 2956 [2019-10-14 23:13:57,415 INFO L226 Difference]: Without dead ends: 2954 [2019-10-14 23:13:57,416 INFO L600 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-10-14 23:13:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-14 23:13:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-10-14 23:13:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-14 23:13:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-10-14 23:13:57,517 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-10-14 23:13:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,517 INFO L462 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-10-14 23:13:57,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-10-14 23:13:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:57,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,522 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:57,522 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-10-14 23:13:57,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494561133] [2019-10-14 23:13:57,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:57,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494561133] [2019-10-14 23:13:57,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703482777] [2019-10-14 23:13:57,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,550 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-10-14 23:13:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,619 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2019-10-14 23:13:57,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,634 INFO L225 Difference]: With dead ends: 5836 [2019-10-14 23:13:57,634 INFO L226 Difference]: Without dead ends: 3338 [2019-10-14 23:13:57,639 INFO L600 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-10-14 23:13:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-14 23:13:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-10-14 23:13:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-14 23:13:57,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-10-14 23:13:57,733 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-10-14 23:13:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,734 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-10-14 23:13:57,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-10-14 23:13:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:57,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,739 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:57,739 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-10-14 23:13:57,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970324301] [2019-10-14 23:13:57,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:57,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970324301] [2019-10-14 23:13:57,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342089874] [2019-10-14 23:13:57,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,766 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-10-14 23:13:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,829 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2019-10-14 23:13:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,844 INFO L225 Difference]: With dead ends: 5004 [2019-10-14 23:13:57,844 INFO L226 Difference]: Without dead ends: 3402 [2019-10-14 23:13:57,849 INFO L600 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-10-14 23:13:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-10-14 23:13:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-10-14 23:13:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-10-14 23:13:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-10-14 23:13:57,963 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-10-14 23:13:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,963 INFO L462 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-10-14 23:13:57,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-10-14 23:13:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:57,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,968 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:57,968 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-10-14 23:13:57,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795591338] [2019-10-14 23:13:57,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:57,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795591338] [2019-10-14 23:13:57,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462415452] [2019-10-14 23:13:57,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:58,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:58,001 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-10-14 23:13:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:58,114 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2019-10-14 23:13:58,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:58,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:58,161 INFO L225 Difference]: With dead ends: 9804 [2019-10-14 23:13:58,162 INFO L226 Difference]: Without dead ends: 6538 [2019-10-14 23:13:58,169 INFO L600 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-10-14 23:13:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-10-14 23:13:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-10-14 23:13:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-14 23:13:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-10-14 23:13:58,359 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-10-14 23:13:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:58,359 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-10-14 23:13:58,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-10-14 23:13:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:58,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:58,368 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:58,369 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-10-14 23:13:58,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:58,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047187583] [2019-10-14 23:13:58,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:58,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:58,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:58,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047187583] [2019-10-14 23:13:58,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:58,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:58,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628051167] [2019-10-14 23:13:58,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:58,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:58,403 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-10-14 23:13:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:58,582 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2019-10-14 23:13:58,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:58,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:58,595 INFO L225 Difference]: With dead ends: 7052 [2019-10-14 23:13:58,595 INFO L226 Difference]: Without dead ends: 7050 [2019-10-14 23:13:58,596 INFO L600 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-10-14 23:13:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-10-14 23:13:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-10-14 23:13:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-14 23:13:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-10-14 23:13:58,759 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-10-14 23:13:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:58,759 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-10-14 23:13:58,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-10-14 23:13:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:58,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:58,767 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:58,767 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-10-14 23:13:58,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:58,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993894967] [2019-10-14 23:13:58,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:58,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:58,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:58,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993894967] [2019-10-14 23:13:58,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:58,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:58,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774031091] [2019-10-14 23:13:58,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:58,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:58,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:58,787 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-10-14 23:13:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:58,924 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2019-10-14 23:13:58,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:58,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:58,942 INFO L225 Difference]: With dead ends: 10634 [2019-10-14 23:13:58,942 INFO L226 Difference]: Without dead ends: 10632 [2019-10-14 23:13:58,946 INFO L600 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-10-14 23:13:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-10-14 23:13:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-10-14 23:13:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-10-14 23:13:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-10-14 23:13:59,177 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-10-14 23:13:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:59,178 INFO L462 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-10-14 23:13:59,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-10-14 23:13:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:59,192 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:59,193 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:59,193 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-10-14 23:13:59,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:59,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43911280] [2019-10-14 23:13:59,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:59,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:59,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:59,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43911280] [2019-10-14 23:13:59,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:59,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:59,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099069999] [2019-10-14 23:13:59,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:59,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:59,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:59,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:59,220 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-10-14 23:13:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:59,383 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2019-10-14 23:13:59,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:59,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:59,384 INFO L225 Difference]: With dead ends: 22664 [2019-10-14 23:13:59,384 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:13:59,415 INFO L600 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-10-14 23:13:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:13:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:13:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:13:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:13:59,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-10-14 23:13:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:59,417 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:13:59,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:13:59,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:13:59,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:13:59,442 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:13:59,442 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:59,442 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:59,442 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:13:59,442 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:13:59,442 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:13:59,443 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,443 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2019-10-14 23:13:59,443 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,443 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-14 23:13:59,443 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,443 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-14 23:13:59,443 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,443 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-10-14 23:13:59,444 INFO L443 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,444 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,445 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-14 23:13:59,445 INFO L446 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-10-14 23:13:59,445 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2019-10-14 23:13:59,445 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,445 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-10-14 23:13:59,445 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,445 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2019-10-14 23:13:59,446 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-10-14 23:13:59,446 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-14 23:13:59,446 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-14 23:13:59,446 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,446 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,446 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,446 INFO L446 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-10-14 23:13:59,446 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,446 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,447 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-14 23:13:59,447 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-14 23:13:59,447 INFO L439 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-10-14 23:13:59,447 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,447 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,447 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-14 23:13:59,447 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-10-14 23:13:59,447 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,447 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-10-14 23:13:59,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:13:59 BoogieIcfgContainer [2019-10-14 23:13:59,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:13:59,460 INFO L168 Benchmark]: Toolchain (without parser) took 5390.82 ms. Allocated memory was 146.8 MB in the beginning and 331.4 MB in the end (delta: 184.5 MB). Free memory was 105.0 MB in the beginning and 106.1 MB in the end (delta: -1.1 MB). Peak memory consumption was 183.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:59,462 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-14 23:13:59,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.45 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 104.6 MB in the beginning and 182.4 MB in the end (delta: -77.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:59,468 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 ms. Allocated memory is still 203.4 MB. Free memory was 182.4 MB in the beginning and 180.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:59,473 INFO L168 Benchmark]: RCFGBuilder took 366.56 ms. Allocated memory is still 203.4 MB. Free memory was 180.4 MB in the beginning and 162.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:59,474 INFO L168 Benchmark]: TraceAbstraction took 4516.25 ms. Allocated memory was 203.4 MB in the beginning and 331.4 MB in the end (delta: 127.9 MB). Free memory was 162.0 MB in the beginning and 106.1 MB in the end (delta: 55.9 MB). Peak memory consumption was 183.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:59,479 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.42 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 456.45 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 104.6 MB in the beginning and 182.4 MB in the end (delta: -77.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.11 ms. Allocated memory is still 203.4 MB. Free memory was 182.4 MB in the beginning and 180.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 366.56 ms. Allocated memory is still 203.4 MB. Free memory was 180.4 MB in the beginning and 162.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4516.25 ms. Allocated memory was 203.4 MB in the beginning and 331.4 MB in the end (delta: 127.9 MB). Free memory was 162.0 MB in the beginning and 106.1 MB in the end (delta: 55.9 MB). Peak memory consumption was 183.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...