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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:51,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:51,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:51,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:51,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:51,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:51,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:51,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:51,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:51,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:51,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:51,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:51,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:51,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:51,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:51,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:51,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:51,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:51,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:51,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:51,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:51,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:51,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:51,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:51,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:51,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:51,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:51,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:51,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:51,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:51,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:51,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:51,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:51,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:51,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:51,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:51,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:51,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:51,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:51,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:51,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:51,672 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-13 19:14:51,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:51,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:51,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:51,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:51,699 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:51,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:51,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:51,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:51,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:51,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:51,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:51,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:51,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:51,702 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:51,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:51,702 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:51,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:51,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:51,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:51,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:51,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:51,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:51,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:51,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:51,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:51,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:51,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:51,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:51,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:51,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:51,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:52,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:52,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:52,004 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:52,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-10-13 19:14:52,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31299c2c/aadcc34d394346798600ba56b4ec79ea/FLAGbb0b08072 [2019-10-13 19:14:52,547 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:52,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-10-13 19:14:52,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31299c2c/aadcc34d394346798600ba56b4ec79ea/FLAGbb0b08072 [2019-10-13 19:14:52,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31299c2c/aadcc34d394346798600ba56b4ec79ea [2019-10-13 19:14:52,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:52,912 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:52,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:52,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:52,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:52,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19511e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52, skipping insertion in model container [2019-10-13 19:14:52,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,929 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:52,950 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:53,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:53,131 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:53,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:53,171 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:53,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53 WrapperNode [2019-10-13 19:14:53,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:53,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:53,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:53,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:53,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (1/1) ... [2019-10-13 19:14:53,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (1/1) ... [2019-10-13 19:14:53,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (1/1) ... [2019-10-13 19:14:53,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (1/1) ... [2019-10-13 19:14:53,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (1/1) ... [2019-10-13 19:14:53,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (1/1) ... [2019-10-13 19:14:53,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (1/1) ... [2019-10-13 19:14:53,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:53,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:53,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:53,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:53,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (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-13 19:14:53,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:53,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:53,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:53,695 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:53,695 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:53,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:53 BoogieIcfgContainer [2019-10-13 19:14:53,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:53,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:53,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:53,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:53,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:52" (1/3) ... [2019-10-13 19:14:53,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feaee26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:53, skipping insertion in model container [2019-10-13 19:14:53,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:53" (2/3) ... [2019-10-13 19:14:53,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feaee26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:53, skipping insertion in model container [2019-10-13 19:14:53,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:53" (3/3) ... [2019-10-13 19:14:53,704 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-10-13 19:14:53,712 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:53,718 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:53,728 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:53,751 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:53,751 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:53,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:53,752 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:53,752 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:53,752 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:53,752 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:53,752 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 19:14:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:53,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,775 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-10-13 19:14:53,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180259094] [2019-10-13 19:14:53,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,962 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-13 19:14:53,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180259094] [2019-10-13 19:14:53,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520240985] [2019-10-13 19:14:53,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,988 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-13 19:14:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,048 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2019-10-13 19:14:54,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,062 INFO L225 Difference]: With dead ends: 75 [2019-10-13 19:14:54,063 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 19:14:54,066 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-13 19:14:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 19:14:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-10-13 19:14:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 19:14:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-10-13 19:14:54,113 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-10-13 19:14:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,113 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-10-13 19:14:54,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-10-13 19:14:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:54,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,115 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-10-13 19:14:54,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954965164] [2019-10-13 19:14:54,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,197 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-13 19:14:54,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954965164] [2019-10-13 19:14:54,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973902590] [2019-10-13 19:14:54,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,203 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-10-13 19:14:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,230 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2019-10-13 19:14:54,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,233 INFO L225 Difference]: With dead ends: 97 [2019-10-13 19:14:54,233 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 19:14:54,234 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-13 19:14:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 19:14:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-13 19:14:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 19:14:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-10-13 19:14:54,245 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-10-13 19:14:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,245 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-10-13 19:14:54,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-10-13 19:14:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,247 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-13 19:14:54,247 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,248 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-10-13 19:14:54,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941411867] [2019-10-13 19:14:54,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,304 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-13 19:14:54,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941411867] [2019-10-13 19:14:54,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937591775] [2019-10-13 19:14:54,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,310 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-10-13 19:14:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,348 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2019-10-13 19:14:54,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,351 INFO L225 Difference]: With dead ends: 90 [2019-10-13 19:14:54,354 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 19:14:54,355 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-13 19:14:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 19:14:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-13 19:14:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 19:14:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-10-13 19:14:54,367 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-10-13 19:14:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,368 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-10-13 19:14:54,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-10-13 19:14:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,369 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-13 19:14:54,370 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,370 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-10-13 19:14:54,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814071255] [2019-10-13 19:14:54,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,419 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-13 19:14:54,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814071255] [2019-10-13 19:14:54,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185749826] [2019-10-13 19:14:54,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,422 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-10-13 19:14:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,443 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2019-10-13 19:14:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,445 INFO L225 Difference]: With dead ends: 112 [2019-10-13 19:14:54,446 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 19:14:54,446 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-13 19:14:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 19:14:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-10-13 19:14:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 19:14:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-10-13 19:14:54,462 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-10-13 19:14:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,463 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-10-13 19:14:54,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-10-13 19:14:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,466 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-13 19:14:54,467 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-10-13 19:14:54,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177051242] [2019-10-13 19:14:54,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,526 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-13 19:14:54,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177051242] [2019-10-13 19:14:54,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910233403] [2019-10-13 19:14:54,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,528 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-10-13 19:14:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,564 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2019-10-13 19:14:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,566 INFO L225 Difference]: With dead ends: 184 [2019-10-13 19:14:54,567 INFO L226 Difference]: Without dead ends: 112 [2019-10-13 19:14:54,568 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-13 19:14:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-13 19:14:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-10-13 19:14:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 19:14:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-10-13 19:14:54,579 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-10-13 19:14:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,580 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-10-13 19:14:54,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-10-13 19:14:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,581 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-13 19:14:54,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,582 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-10-13 19:14:54,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326109058] [2019-10-13 19:14:54,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,639 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-13 19:14:54,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326109058] [2019-10-13 19:14:54,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73411472] [2019-10-13 19:14:54,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,648 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-10-13 19:14:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,681 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2019-10-13 19:14:54,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,683 INFO L225 Difference]: With dead ends: 165 [2019-10-13 19:14:54,683 INFO L226 Difference]: Without dead ends: 114 [2019-10-13 19:14:54,684 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-13 19:14:54,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-13 19:14:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-10-13 19:14:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-13 19:14:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-10-13 19:14:54,696 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-10-13 19:14:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,696 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-10-13 19:14:54,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-10-13 19:14:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,698 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-13 19:14:54,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,699 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-10-13 19:14:54,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674713086] [2019-10-13 19:14:54,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,736 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-13 19:14:54,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674713086] [2019-10-13 19:14:54,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127682263] [2019-10-13 19:14:54,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,739 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-10-13 19:14:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,760 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2019-10-13 19:14:54,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,762 INFO L225 Difference]: With dead ends: 204 [2019-10-13 19:14:54,763 INFO L226 Difference]: Without dead ends: 202 [2019-10-13 19:14:54,763 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-13 19:14:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-13 19:14:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-10-13 19:14:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-13 19:14:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-10-13 19:14:54,783 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-10-13 19:14:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,786 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-10-13 19:14:54,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-10-13 19:14:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,789 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-13 19:14:54,789 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-10-13 19:14:54,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614353998] [2019-10-13 19:14:54,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,852 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-13 19:14:54,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614353998] [2019-10-13 19:14:54,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3144508] [2019-10-13 19:14:54,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,855 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-10-13 19:14:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,879 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2019-10-13 19:14:54,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,882 INFO L225 Difference]: With dead ends: 352 [2019-10-13 19:14:54,882 INFO L226 Difference]: Without dead ends: 210 [2019-10-13 19:14:54,883 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-13 19:14:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-13 19:14:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-10-13 19:14:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-13 19:14:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-10-13 19:14:54,908 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-10-13 19:14:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,909 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-10-13 19:14:54,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-10-13 19:14:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:54,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,913 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-13 19:14:54,914 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-10-13 19:14:54,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722969708] [2019-10-13 19:14:54,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,956 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-13 19:14:54,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722969708] [2019-10-13 19:14:54,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298747254] [2019-10-13 19:14:54,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,959 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-10-13 19:14:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,989 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-10-13 19:14:54,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,991 INFO L225 Difference]: With dead ends: 312 [2019-10-13 19:14:54,991 INFO L226 Difference]: Without dead ends: 214 [2019-10-13 19:14:54,994 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-13 19:14:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-13 19:14:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-13 19:14:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-13 19:14:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-10-13 19:14:55,005 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-10-13 19:14:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,006 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-10-13 19:14:55,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-10-13 19:14:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:55,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,007 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-13 19:14:55,008 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-10-13 19:14:55,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132389595] [2019-10-13 19:14:55,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,040 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-13 19:14:55,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132389595] [2019-10-13 19:14:55,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373110129] [2019-10-13 19:14:55,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,042 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-10-13 19:14:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,064 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2019-10-13 19:14:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,067 INFO L225 Difference]: With dead ends: 380 [2019-10-13 19:14:55,067 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 19:14:55,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-13 19:14:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 19:14:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-10-13 19:14:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-13 19:14:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-10-13 19:14:55,080 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-10-13 19:14:55,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,080 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-10-13 19:14:55,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-10-13 19:14:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:55,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,082 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-13 19:14:55,082 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-10-13 19:14:55,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208661023] [2019-10-13 19:14:55,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,110 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-13 19:14:55,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208661023] [2019-10-13 19:14:55,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989602938] [2019-10-13 19:14:55,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,113 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-10-13 19:14:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,148 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2019-10-13 19:14:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,151 INFO L225 Difference]: With dead ends: 684 [2019-10-13 19:14:55,151 INFO L226 Difference]: Without dead ends: 402 [2019-10-13 19:14:55,153 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-13 19:14:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-13 19:14:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-10-13 19:14:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-13 19:14:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-10-13 19:14:55,181 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-10-13 19:14:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,182 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-10-13 19:14:55,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-10-13 19:14:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:55,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,187 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-13 19:14:55,187 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-10-13 19:14:55,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588610692] [2019-10-13 19:14:55,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,232 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-13 19:14:55,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588610692] [2019-10-13 19:14:55,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163998353] [2019-10-13 19:14:55,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,234 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-10-13 19:14:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,256 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2019-10-13 19:14:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,259 INFO L225 Difference]: With dead ends: 600 [2019-10-13 19:14:55,260 INFO L226 Difference]: Without dead ends: 410 [2019-10-13 19:14:55,260 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-13 19:14:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-13 19:14:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-10-13 19:14:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-13 19:14:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-10-13 19:14:55,274 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-10-13 19:14:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,274 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-10-13 19:14:55,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-10-13 19:14:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:55,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,276 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-13 19:14:55,276 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-10-13 19:14:55,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439490672] [2019-10-13 19:14:55,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,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-13 19:14:55,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439490672] [2019-10-13 19:14:55,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192942186] [2019-10-13 19:14:55,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,301 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-10-13 19:14:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,329 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2019-10-13 19:14:55,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,334 INFO L225 Difference]: With dead ends: 716 [2019-10-13 19:14:55,334 INFO L226 Difference]: Without dead ends: 714 [2019-10-13 19:14:55,335 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-13 19:14:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-13 19:14:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-10-13 19:14:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 19:14:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-10-13 19:14:55,355 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-10-13 19:14:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,355 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-10-13 19:14:55,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-10-13 19:14:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:55,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,357 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-13 19:14:55,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,358 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-10-13 19:14:55,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227405055] [2019-10-13 19:14:55,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,382 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-13 19:14:55,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227405055] [2019-10-13 19:14:55,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415226790] [2019-10-13 19:14:55,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,385 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-10-13 19:14:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,417 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2019-10-13 19:14:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,422 INFO L225 Difference]: With dead ends: 1340 [2019-10-13 19:14:55,423 INFO L226 Difference]: Without dead ends: 778 [2019-10-13 19:14:55,425 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-13 19:14:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-10-13 19:14:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-10-13 19:14:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-13 19:14:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-10-13 19:14:55,452 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-10-13 19:14:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,452 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-10-13 19:14:55,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-10-13 19:14:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:55,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,455 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-13 19:14:55,455 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-10-13 19:14:55,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559604712] [2019-10-13 19:14:55,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,482 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-13 19:14:55,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559604712] [2019-10-13 19:14:55,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804297016] [2019-10-13 19:14:55,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,486 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-10-13 19:14:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,515 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2019-10-13 19:14:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,520 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 19:14:55,520 INFO L226 Difference]: Without dead ends: 794 [2019-10-13 19:14:55,524 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-13 19:14:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-13 19:14:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-10-13 19:14:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-10-13 19:14:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-10-13 19:14:55,553 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-10-13 19:14:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,554 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-10-13 19:14:55,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-10-13 19:14:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:55,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,556 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-13 19:14:55,557 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-10-13 19:14:55,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883621859] [2019-10-13 19:14:55,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,590 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-13 19:14:55,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883621859] [2019-10-13 19:14:55,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997763796] [2019-10-13 19:14:55,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,592 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-10-13 19:14:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,633 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2019-10-13 19:14:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,641 INFO L225 Difference]: With dead ends: 1356 [2019-10-13 19:14:55,641 INFO L226 Difference]: Without dead ends: 1354 [2019-10-13 19:14:55,642 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-13 19:14:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-13 19:14:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-10-13 19:14:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-13 19:14:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-10-13 19:14:55,697 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-10-13 19:14:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,698 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-10-13 19:14:55,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-10-13 19:14:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:55,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,701 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-13 19:14:55,701 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-10-13 19:14:55,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688901842] [2019-10-13 19:14:55,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,721 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-13 19:14:55,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688901842] [2019-10-13 19:14:55,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237988831] [2019-10-13 19:14:55,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,723 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-10-13 19:14:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,768 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2019-10-13 19:14:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,776 INFO L225 Difference]: With dead ends: 2636 [2019-10-13 19:14:55,776 INFO L226 Difference]: Without dead ends: 1514 [2019-10-13 19:14:55,779 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-13 19:14:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-10-13 19:14:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-10-13 19:14:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-10-13 19:14:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-10-13 19:14:55,836 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-10-13 19:14:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,836 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-10-13 19:14:55,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-10-13 19:14:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:55,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,840 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-13 19:14:55,841 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-10-13 19:14:55,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978027557] [2019-10-13 19:14:55,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,863 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-13 19:14:55,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978027557] [2019-10-13 19:14:55,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227490069] [2019-10-13 19:14:55,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,865 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-10-13 19:14:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,917 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2019-10-13 19:14:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,927 INFO L225 Difference]: With dead ends: 2268 [2019-10-13 19:14:55,928 INFO L226 Difference]: Without dead ends: 1546 [2019-10-13 19:14:55,930 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-13 19:14:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-13 19:14:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-10-13 19:14:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-13 19:14:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-10-13 19:14:55,994 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-10-13 19:14:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,994 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-10-13 19:14:55,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-10-13 19:14:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:55,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,999 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-13 19:14:55,999 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-10-13 19:14:56,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023685053] [2019-10-13 19:14:56,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,037 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-13 19:14:56,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023685053] [2019-10-13 19:14:56,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229428576] [2019-10-13 19:14:56,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,042 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-10-13 19:14:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,114 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2019-10-13 19:14:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,126 INFO L225 Difference]: With dead ends: 2572 [2019-10-13 19:14:56,126 INFO L226 Difference]: Without dead ends: 2570 [2019-10-13 19:14:56,128 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-13 19:14:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-10-13 19:14:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-10-13 19:14:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-13 19:14:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-10-13 19:14:56,206 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-10-13 19:14:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,206 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-10-13 19:14:56,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-10-13 19:14:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:56,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,211 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-13 19:14:56,211 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,212 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-10-13 19:14:56,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641146521] [2019-10-13 19:14:56,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,230 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-13 19:14:56,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641146521] [2019-10-13 19:14:56,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611880610] [2019-10-13 19:14:56,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,233 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-10-13 19:14:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,346 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2019-10-13 19:14:56,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,360 INFO L225 Difference]: With dead ends: 5196 [2019-10-13 19:14:56,360 INFO L226 Difference]: Without dead ends: 2954 [2019-10-13 19:14:56,364 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-13 19:14:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-13 19:14:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-10-13 19:14:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-10-13 19:14:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-10-13 19:14:56,452 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-10-13 19:14:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,452 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-10-13 19:14:56,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-10-13 19:14:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:56,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,457 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-13 19:14:56,457 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-10-13 19:14:56,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055534481] [2019-10-13 19:14:56,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,482 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-13 19:14:56,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055534481] [2019-10-13 19:14:56,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179103153] [2019-10-13 19:14:56,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,486 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-10-13 19:14:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,548 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2019-10-13 19:14:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,562 INFO L225 Difference]: With dead ends: 4428 [2019-10-13 19:14:56,562 INFO L226 Difference]: Without dead ends: 3018 [2019-10-13 19:14:56,566 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-13 19:14:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-10-13 19:14:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-10-13 19:14:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-10-13 19:14:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-10-13 19:14:56,655 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-10-13 19:14:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,655 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-10-13 19:14:56,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-10-13 19:14:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:56,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,661 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-13 19:14:56,661 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-10-13 19:14:56,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075187016] [2019-10-13 19:14:56,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,684 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-13 19:14:56,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075187016] [2019-10-13 19:14:56,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852579365] [2019-10-13 19:14:56,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,687 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-10-13 19:14:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,816 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2019-10-13 19:14:56,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,830 INFO L225 Difference]: With dead ends: 8650 [2019-10-13 19:14:56,830 INFO L226 Difference]: Without dead ends: 3016 [2019-10-13 19:14:56,841 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-13 19:14:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-10-13 19:14:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-10-13 19:14:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-10-13 19:14:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-10-13 19:14:56,935 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-10-13 19:14:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,936 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-10-13 19:14:56,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-10-13 19:14:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:56,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,941 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-13 19:14:56,941 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,942 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-10-13 19:14:56,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408886150] [2019-10-13 19:14:56,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,962 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-13 19:14:56,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408886150] [2019-10-13 19:14:56,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197869616] [2019-10-13 19:14:56,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,964 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-10-13 19:14:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:57,009 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2019-10-13 19:14:57,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:57,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:57,010 INFO L225 Difference]: With dead ends: 3016 [2019-10-13 19:14:57,010 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:57,015 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-13 19:14:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:57,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-13 19:14:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,017 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:57,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:57,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:57,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:57,043 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:14:57,043 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:57,044 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:57,044 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:57,044 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:57,044 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:57,044 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-13 19:14:57,044 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-10-13 19:14:57,044 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,045 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-10-13 19:14:57,045 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,046 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-13 19:14:57,046 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,046 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,046 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-10-13 19:14:57,046 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-10-13 19:14:57,046 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-13 19:14:57,047 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-10-13 19:14:57,047 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-13 19:14:57,047 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,047 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,047 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,047 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,047 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-10-13 19:14:57,047 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,048 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-13 19:14:57,048 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-10-13 19:14:57,048 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,048 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,049 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-13 19:14:57,049 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-10-13 19:14:57,050 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,050 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-10-13 19:14:57,050 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,050 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,050 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-10-13 19:14:57,050 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-10-13 19:14:57,050 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 19:14:57,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:57 BoogieIcfgContainer [2019-10-13 19:14:57,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:57,064 INFO L168 Benchmark]: Toolchain (without parser) took 4149.78 ms. Allocated memory was 138.9 MB in the beginning and 293.6 MB in the end (delta: 154.7 MB). Free memory was 103.6 MB in the beginning and 184.4 MB in the end (delta: -80.8 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:57,065 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:57,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.86 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:57,075 INFO L168 Benchmark]: Boogie Preprocessor took 115.64 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 181.2 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:57,076 INFO L168 Benchmark]: RCFGBuilder took 408.34 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 164.1 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:57,080 INFO L168 Benchmark]: TraceAbstraction took 3362.47 ms. Allocated memory was 203.4 MB in the beginning and 293.6 MB in the end (delta: 90.2 MB). Free memory was 164.1 MB in the beginning and 184.4 MB in the end (delta: -20.3 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:57,088 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.52 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.86 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.64 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 181.2 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.34 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 164.1 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3362.47 ms. Allocated memory was 203.4 MB in the beginning and 293.6 MB in the end (delta: 90.2 MB). Free memory was 164.1 MB in the beginning and 184.4 MB in the end (delta: -20.3 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...