/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:22:35,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:22:35,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:22:35,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:22:35,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:22:35,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:22:35,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:22:35,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:22:35,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:22:35,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:22:35,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:22:35,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:22:35,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:22:35,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:22:35,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:22:35,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:22:35,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:22:35,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:22:35,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:22:35,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:22:35,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:22:35,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:22:35,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:22:35,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:22:35,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:22:35,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:22:35,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:22:35,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:22:35,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:22:35,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:22:35,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:22:35,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:22:35,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:22:35,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:22:35,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:22:35,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:22:35,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:22:35,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:22:35,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:22:35,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:22:35,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:22:35,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:22:35,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:22:35,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:22:35,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:22:35,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:22:35,965 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:22:35,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:22:35,965 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:22:35,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:22:35,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:22:35,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:22:35,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:22:35,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:22:35,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:22:35,968 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:22:35,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:22:35,968 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:22:35,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:22:35,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:22:35,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:22:35,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:22:35,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:22:35,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:22:35,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:22:35,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:22:35,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:22:35,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:22:35,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:22:35,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:22:35,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:22:36,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:22:36,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:22:36,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:22:36,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:22:36,259 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:22:36,260 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-06 22:22:36,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62affd014/84a49dd0ee0443448ce8a27bf3815a66/FLAGd792d202f [2019-11-06 22:22:36,834 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:22:36,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-06 22:22:36,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62affd014/84a49dd0ee0443448ce8a27bf3815a66/FLAGd792d202f [2019-11-06 22:22:37,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62affd014/84a49dd0ee0443448ce8a27bf3815a66 [2019-11-06 22:22:37,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:22:37,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:22:37,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:37,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:22:37,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:22:37,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc07b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37, skipping insertion in model container [2019-11-06 22:22:37,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,240 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:22:37,299 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:22:37,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:37,591 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:22:37,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:37,780 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:22:37,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37 WrapperNode [2019-11-06 22:22:37,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:37,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:22:37,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:22:37,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:22:37,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (1/1) ... [2019-11-06 22:22:37,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:22:37,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:22:37,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:22:37,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:22:37,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:22:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:22:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:22:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-06 22:22:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2019-11-06 22:22:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:22:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:22:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:22:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:22:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 22:22:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 22:22:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2019-11-06 22:22:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-06 22:22:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:22:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:22:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:22:38,112 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 22:22:38,685 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-06 22:22:38,686 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-06 22:22:38,695 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:22:38,696 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:22:38,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:38 BoogieIcfgContainer [2019-11-06 22:22:38,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:22:38,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:22:38,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:22:38,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:22:38,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:37" (1/3) ... [2019-11-06 22:22:38,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5033390b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:38, skipping insertion in model container [2019-11-06 22:22:38,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:37" (2/3) ... [2019-11-06 22:22:38,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5033390b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:38, skipping insertion in model container [2019-11-06 22:22:38,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:38" (3/3) ... [2019-11-06 22:22:38,712 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-11-06 22:22:38,721 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:22:38,729 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:22:38,740 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:22:38,768 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:22:38,768 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:22:38,768 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:22:38,769 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:22:38,769 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:22:38,769 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:22:38,769 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:22:38,769 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:22:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-11-06 22:22:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 22:22:38,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:38,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:38,808 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:38,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1696698376, now seen corresponding path program 1 times [2019-11-06 22:22:38,824 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:38,824 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484295037] [2019-11-06 22:22:38,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:39,165 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484295037] [2019-11-06 22:22:39,166 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:39,167 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:39,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815742847] [2019-11-06 22:22:39,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:39,174 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:39,192 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-11-06 22:22:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:39,614 INFO L93 Difference]: Finished difference Result 345 states and 585 transitions. [2019-11-06 22:22:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:39,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-06 22:22:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:39,630 INFO L225 Difference]: With dead ends: 345 [2019-11-06 22:22:39,631 INFO L226 Difference]: Without dead ends: 183 [2019-11-06 22:22:39,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-06 22:22:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2019-11-06 22:22:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-06 22:22:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 284 transitions. [2019-11-06 22:22:39,715 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 284 transitions. Word has length 51 [2019-11-06 22:22:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:39,716 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 284 transitions. [2019-11-06 22:22:39,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 284 transitions. [2019-11-06 22:22:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 22:22:39,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:39,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:39,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:39,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash 742008338, now seen corresponding path program 1 times [2019-11-06 22:22:39,725 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:39,725 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909272536] [2019-11-06 22:22:39,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:39,879 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909272536] [2019-11-06 22:22:39,879 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:39,879 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:39,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491483984] [2019-11-06 22:22:39,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:39,883 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:39,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:39,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:39,885 INFO L87 Difference]: Start difference. First operand 178 states and 284 transitions. Second operand 5 states. [2019-11-06 22:22:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:40,191 INFO L93 Difference]: Finished difference Result 391 states and 639 transitions. [2019-11-06 22:22:40,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:40,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-06 22:22:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:40,195 INFO L225 Difference]: With dead ends: 391 [2019-11-06 22:22:40,195 INFO L226 Difference]: Without dead ends: 224 [2019-11-06 22:22:40,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-06 22:22:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-11-06 22:22:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-06 22:22:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 361 transitions. [2019-11-06 22:22:40,218 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 361 transitions. Word has length 52 [2019-11-06 22:22:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:40,218 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 361 transitions. [2019-11-06 22:22:40,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 361 transitions. [2019-11-06 22:22:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-06 22:22:40,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:40,223 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:40,223 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash 201696029, now seen corresponding path program 1 times [2019-11-06 22:22:40,224 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:40,224 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960516987] [2019-11-06 22:22:40,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:40,348 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960516987] [2019-11-06 22:22:40,348 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:40,348 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:40,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200976115] [2019-11-06 22:22:40,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:40,349 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:40,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:40,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:40,350 INFO L87 Difference]: Start difference. First operand 219 states and 361 transitions. Second operand 5 states. [2019-11-06 22:22:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:40,613 INFO L93 Difference]: Finished difference Result 456 states and 763 transitions. [2019-11-06 22:22:40,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:40,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-06 22:22:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:40,617 INFO L225 Difference]: With dead ends: 456 [2019-11-06 22:22:40,617 INFO L226 Difference]: Without dead ends: 250 [2019-11-06 22:22:40,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-06 22:22:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-11-06 22:22:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-06 22:22:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-11-06 22:22:40,636 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 80 [2019-11-06 22:22:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:40,637 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-11-06 22:22:40,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-11-06 22:22:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-06 22:22:40,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:40,641 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:40,641 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:40,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1556256498, now seen corresponding path program 1 times [2019-11-06 22:22:40,642 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:40,642 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525432034] [2019-11-06 22:22:40,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:40,779 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525432034] [2019-11-06 22:22:40,779 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:40,780 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:40,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873399204] [2019-11-06 22:22:40,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:40,781 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:40,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:40,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:40,781 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 5 states. [2019-11-06 22:22:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:41,012 INFO L93 Difference]: Finished difference Result 533 states and 899 transitions. [2019-11-06 22:22:41,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:41,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-11-06 22:22:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:41,015 INFO L225 Difference]: With dead ends: 533 [2019-11-06 22:22:41,015 INFO L226 Difference]: Without dead ends: 296 [2019-11-06 22:22:41,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-06 22:22:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-06 22:22:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-06 22:22:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-11-06 22:22:41,032 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 91 [2019-11-06 22:22:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:41,032 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-11-06 22:22:41,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-11-06 22:22:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-06 22:22:41,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:41,036 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:41,036 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1933322156, now seen corresponding path program 1 times [2019-11-06 22:22:41,037 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:41,037 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863176913] [2019-11-06 22:22:41,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:41,102 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863176913] [2019-11-06 22:22:41,102 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:41,103 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:41,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23103409] [2019-11-06 22:22:41,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:41,104 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:41,104 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 5 states. [2019-11-06 22:22:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:41,350 INFO L93 Difference]: Finished difference Result 575 states and 972 transitions. [2019-11-06 22:22:41,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:41,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-11-06 22:22:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:41,353 INFO L225 Difference]: With dead ends: 575 [2019-11-06 22:22:41,354 INFO L226 Difference]: Without dead ends: 294 [2019-11-06 22:22:41,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:41,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-06 22:22:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2019-11-06 22:22:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-06 22:22:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 487 transitions. [2019-11-06 22:22:41,376 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 487 transitions. Word has length 92 [2019-11-06 22:22:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:41,376 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 487 transitions. [2019-11-06 22:22:41,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 487 transitions. [2019-11-06 22:22:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-06 22:22:41,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:41,380 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:41,380 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1585840345, now seen corresponding path program 1 times [2019-11-06 22:22:41,381 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:41,381 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200685700] [2019-11-06 22:22:41,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:22:41,483 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200685700] [2019-11-06 22:22:41,484 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:41,484 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:41,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251872766] [2019-11-06 22:22:41,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:41,487 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:41,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:41,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:41,489 INFO L87 Difference]: Start difference. First operand 290 states and 487 transitions. Second operand 5 states. [2019-11-06 22:22:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:41,666 INFO L93 Difference]: Finished difference Result 584 states and 985 transitions. [2019-11-06 22:22:41,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:41,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-11-06 22:22:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:41,670 INFO L225 Difference]: With dead ends: 584 [2019-11-06 22:22:41,670 INFO L226 Difference]: Without dead ends: 307 [2019-11-06 22:22:41,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-06 22:22:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-11-06 22:22:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-06 22:22:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 509 transitions. [2019-11-06 22:22:41,688 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 509 transitions. Word has length 92 [2019-11-06 22:22:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:41,692 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 509 transitions. [2019-11-06 22:22:41,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 509 transitions. [2019-11-06 22:22:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-06 22:22:41,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:41,702 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:41,702 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash 6376232, now seen corresponding path program 1 times [2019-11-06 22:22:41,703 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:41,703 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174065962] [2019-11-06 22:22:41,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:22:41,793 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174065962] [2019-11-06 22:22:41,793 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:41,793 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:41,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311196549] [2019-11-06 22:22:41,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:41,794 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:41,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:41,795 INFO L87 Difference]: Start difference. First operand 305 states and 509 transitions. Second operand 5 states. [2019-11-06 22:22:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:41,989 INFO L93 Difference]: Finished difference Result 599 states and 1003 transitions. [2019-11-06 22:22:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:41,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-06 22:22:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:41,992 INFO L225 Difference]: With dead ends: 599 [2019-11-06 22:22:41,992 INFO L226 Difference]: Without dead ends: 307 [2019-11-06 22:22:41,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-06 22:22:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-11-06 22:22:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-06 22:22:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 505 transitions. [2019-11-06 22:22:42,007 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 505 transitions. Word has length 93 [2019-11-06 22:22:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:42,007 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 505 transitions. [2019-11-06 22:22:42,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 505 transitions. [2019-11-06 22:22:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:22:42,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:42,010 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:42,010 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash -854791455, now seen corresponding path program 1 times [2019-11-06 22:22:42,010 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:42,011 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617955079] [2019-11-06 22:22:42,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-06 22:22:42,065 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617955079] [2019-11-06 22:22:42,066 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:42,066 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:42,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38518510] [2019-11-06 22:22:42,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:42,067 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:42,067 INFO L87 Difference]: Start difference. First operand 305 states and 505 transitions. Second operand 5 states. [2019-11-06 22:22:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:42,237 INFO L93 Difference]: Finished difference Result 606 states and 1005 transitions. [2019-11-06 22:22:42,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:42,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-06 22:22:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:42,239 INFO L225 Difference]: With dead ends: 606 [2019-11-06 22:22:42,240 INFO L226 Difference]: Without dead ends: 314 [2019-11-06 22:22:42,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-06 22:22:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-11-06 22:22:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-06 22:22:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 511 transitions. [2019-11-06 22:22:42,254 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 511 transitions. Word has length 106 [2019-11-06 22:22:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:42,255 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 511 transitions. [2019-11-06 22:22:42,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 511 transitions. [2019-11-06 22:22:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:22:42,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:42,257 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:42,257 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1777100668, now seen corresponding path program 1 times [2019-11-06 22:22:42,258 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:42,258 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391093922] [2019-11-06 22:22:42,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:22:42,305 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391093922] [2019-11-06 22:22:42,305 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:42,306 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:42,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505494332] [2019-11-06 22:22:42,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:42,307 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:42,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:42,307 INFO L87 Difference]: Start difference. First operand 314 states and 511 transitions. Second operand 5 states. [2019-11-06 22:22:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:42,505 INFO L93 Difference]: Finished difference Result 646 states and 1058 transitions. [2019-11-06 22:22:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:42,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-06 22:22:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:42,508 INFO L225 Difference]: With dead ends: 646 [2019-11-06 22:22:42,508 INFO L226 Difference]: Without dead ends: 345 [2019-11-06 22:22:42,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-06 22:22:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-06 22:22:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-06 22:22:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 558 transitions. [2019-11-06 22:22:42,527 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 558 transitions. Word has length 106 [2019-11-06 22:22:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:42,528 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 558 transitions. [2019-11-06 22:22:42,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 558 transitions. [2019-11-06 22:22:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 22:22:42,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:42,530 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:42,530 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1284309403, now seen corresponding path program 1 times [2019-11-06 22:22:42,531 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:42,531 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4774935] [2019-11-06 22:22:42,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:22:42,606 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4774935] [2019-11-06 22:22:42,606 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:42,606 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:42,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733157484] [2019-11-06 22:22:42,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:42,607 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:42,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:42,607 INFO L87 Difference]: Start difference. First operand 343 states and 558 transitions. Second operand 5 states. [2019-11-06 22:22:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:42,828 INFO L93 Difference]: Finished difference Result 675 states and 1101 transitions. [2019-11-06 22:22:42,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:42,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-11-06 22:22:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:42,832 INFO L225 Difference]: With dead ends: 675 [2019-11-06 22:22:42,832 INFO L226 Difference]: Without dead ends: 345 [2019-11-06 22:22:42,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-06 22:22:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-06 22:22:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-06 22:22:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 554 transitions. [2019-11-06 22:22:42,849 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 554 transitions. Word has length 107 [2019-11-06 22:22:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:42,850 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 554 transitions. [2019-11-06 22:22:42,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 554 transitions. [2019-11-06 22:22:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-06 22:22:42,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:42,852 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:42,852 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1845761004, now seen corresponding path program 1 times [2019-11-06 22:22:42,853 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:42,853 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078532108] [2019-11-06 22:22:42,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:22:42,916 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078532108] [2019-11-06 22:22:42,916 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:42,917 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:42,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789148594] [2019-11-06 22:22:42,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:42,917 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:42,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:42,918 INFO L87 Difference]: Start difference. First operand 343 states and 554 transitions. Second operand 5 states. [2019-11-06 22:22:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:43,116 INFO L93 Difference]: Finished difference Result 708 states and 1151 transitions. [2019-11-06 22:22:43,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:43,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-11-06 22:22:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:43,119 INFO L225 Difference]: With dead ends: 708 [2019-11-06 22:22:43,119 INFO L226 Difference]: Without dead ends: 378 [2019-11-06 22:22:43,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-06 22:22:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-11-06 22:22:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-06 22:22:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 596 transitions. [2019-11-06 22:22:43,136 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 596 transitions. Word has length 108 [2019-11-06 22:22:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:43,136 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 596 transitions. [2019-11-06 22:22:43,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 596 transitions. [2019-11-06 22:22:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-06 22:22:43,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:43,139 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:43,139 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2036530603, now seen corresponding path program 1 times [2019-11-06 22:22:43,140 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:43,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673556597] [2019-11-06 22:22:43,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:22:43,204 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673556597] [2019-11-06 22:22:43,204 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:43,204 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:43,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687070427] [2019-11-06 22:22:43,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:43,205 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:43,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:43,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:43,206 INFO L87 Difference]: Start difference. First operand 370 states and 596 transitions. Second operand 5 states. [2019-11-06 22:22:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:43,453 INFO L93 Difference]: Finished difference Result 735 states and 1188 transitions. [2019-11-06 22:22:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:43,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-06 22:22:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:43,458 INFO L225 Difference]: With dead ends: 735 [2019-11-06 22:22:43,458 INFO L226 Difference]: Without dead ends: 378 [2019-11-06 22:22:43,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-06 22:22:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-11-06 22:22:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-06 22:22:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 591 transitions. [2019-11-06 22:22:43,481 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 591 transitions. Word has length 109 [2019-11-06 22:22:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:43,481 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 591 transitions. [2019-11-06 22:22:43,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 591 transitions. [2019-11-06 22:22:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-06 22:22:43,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:43,484 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:43,484 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash -346552109, now seen corresponding path program 1 times [2019-11-06 22:22:43,485 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:43,485 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46730501] [2019-11-06 22:22:43,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-06 22:22:43,555 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46730501] [2019-11-06 22:22:43,555 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:43,555 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:43,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134145763] [2019-11-06 22:22:43,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:43,556 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:43,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:43,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:43,557 INFO L87 Difference]: Start difference. First operand 370 states and 591 transitions. Second operand 5 states. [2019-11-06 22:22:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:43,745 INFO L93 Difference]: Finished difference Result 752 states and 1206 transitions. [2019-11-06 22:22:43,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:43,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-11-06 22:22:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:43,748 INFO L225 Difference]: With dead ends: 752 [2019-11-06 22:22:43,748 INFO L226 Difference]: Without dead ends: 395 [2019-11-06 22:22:43,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-06 22:22:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-11-06 22:22:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-06 22:22:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2019-11-06 22:22:43,766 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 112 [2019-11-06 22:22:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:43,766 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2019-11-06 22:22:43,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2019-11-06 22:22:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-06 22:22:43,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:43,769 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:43,769 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:43,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 768287860, now seen corresponding path program 1 times [2019-11-06 22:22:43,769 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:43,769 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743799909] [2019-11-06 22:22:43,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-06 22:22:43,816 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743799909] [2019-11-06 22:22:43,816 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:43,816 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:43,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914290960] [2019-11-06 22:22:43,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:43,817 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:43,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:43,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:43,817 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand 5 states. [2019-11-06 22:22:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:44,006 INFO L93 Difference]: Finished difference Result 773 states and 1229 transitions. [2019-11-06 22:22:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:44,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-11-06 22:22:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:44,009 INFO L225 Difference]: With dead ends: 773 [2019-11-06 22:22:44,009 INFO L226 Difference]: Without dead ends: 395 [2019-11-06 22:22:44,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-06 22:22:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-11-06 22:22:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-06 22:22:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 614 transitions. [2019-11-06 22:22:44,028 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 614 transitions. Word has length 113 [2019-11-06 22:22:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:44,028 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 614 transitions. [2019-11-06 22:22:44,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 614 transitions. [2019-11-06 22:22:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-06 22:22:44,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:44,031 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:44,031 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash -105487368, now seen corresponding path program 1 times [2019-11-06 22:22:44,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:44,032 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136660206] [2019-11-06 22:22:44,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-06 22:22:44,094 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136660206] [2019-11-06 22:22:44,095 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:44,095 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:44,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516630836] [2019-11-06 22:22:44,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:44,096 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:44,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:44,096 INFO L87 Difference]: Start difference. First operand 391 states and 614 transitions. Second operand 3 states. [2019-11-06 22:22:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:44,165 INFO L93 Difference]: Finished difference Result 1144 states and 1806 transitions. [2019-11-06 22:22:44,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:44,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-11-06 22:22:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:44,169 INFO L225 Difference]: With dead ends: 1144 [2019-11-06 22:22:44,169 INFO L226 Difference]: Without dead ends: 766 [2019-11-06 22:22:44,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-11-06 22:22:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-11-06 22:22:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-11-06 22:22:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1207 transitions. [2019-11-06 22:22:44,207 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1207 transitions. Word has length 128 [2019-11-06 22:22:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:44,208 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1207 transitions. [2019-11-06 22:22:44,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1207 transitions. [2019-11-06 22:22:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-06 22:22:44,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:44,212 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:44,212 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1228256447, now seen corresponding path program 1 times [2019-11-06 22:22:44,213 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:44,213 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872395498] [2019-11-06 22:22:44,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-06 22:22:44,276 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872395498] [2019-11-06 22:22:44,278 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:44,279 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:44,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292545970] [2019-11-06 22:22:44,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:44,279 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:44,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:44,280 INFO L87 Difference]: Start difference. First operand 766 states and 1207 transitions. Second operand 5 states. [2019-11-06 22:22:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:44,527 INFO L93 Difference]: Finished difference Result 1603 states and 2533 transitions. [2019-11-06 22:22:44,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:44,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-11-06 22:22:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:44,532 INFO L225 Difference]: With dead ends: 1603 [2019-11-06 22:22:44,532 INFO L226 Difference]: Without dead ends: 850 [2019-11-06 22:22:44,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-11-06 22:22:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 842. [2019-11-06 22:22:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-11-06 22:22:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1325 transitions. [2019-11-06 22:22:44,567 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1325 transitions. Word has length 129 [2019-11-06 22:22:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:44,567 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1325 transitions. [2019-11-06 22:22:44,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1325 transitions. [2019-11-06 22:22:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-06 22:22:44,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:44,571 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:44,571 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 998366491, now seen corresponding path program 1 times [2019-11-06 22:22:44,571 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:44,572 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765796729] [2019-11-06 22:22:44,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-06 22:22:44,639 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765796729] [2019-11-06 22:22:44,639 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:44,639 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:44,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799247617] [2019-11-06 22:22:44,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:44,640 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:44,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:44,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:44,641 INFO L87 Difference]: Start difference. First operand 842 states and 1325 transitions. Second operand 5 states. [2019-11-06 22:22:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:44,898 INFO L93 Difference]: Finished difference Result 1679 states and 2645 transitions. [2019-11-06 22:22:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:44,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-11-06 22:22:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:44,903 INFO L225 Difference]: With dead ends: 1679 [2019-11-06 22:22:44,903 INFO L226 Difference]: Without dead ends: 846 [2019-11-06 22:22:44,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-06 22:22:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 838. [2019-11-06 22:22:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-06 22:22:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1313 transitions. [2019-11-06 22:22:44,940 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1313 transitions. Word has length 130 [2019-11-06 22:22:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:44,940 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1313 transitions. [2019-11-06 22:22:44,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1313 transitions. [2019-11-06 22:22:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-06 22:22:44,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:44,944 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:44,944 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:44,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:44,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1190868920, now seen corresponding path program 1 times [2019-11-06 22:22:44,945 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:44,946 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654127971] [2019-11-06 22:22:44,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-06 22:22:45,010 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654127971] [2019-11-06 22:22:45,010 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:45,010 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:45,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523739850] [2019-11-06 22:22:45,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:45,011 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:45,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:45,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:45,012 INFO L87 Difference]: Start difference. First operand 838 states and 1313 transitions. Second operand 5 states. [2019-11-06 22:22:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:45,250 INFO L93 Difference]: Finished difference Result 1739 states and 2729 transitions. [2019-11-06 22:22:45,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:45,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-11-06 22:22:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:45,255 INFO L225 Difference]: With dead ends: 1739 [2019-11-06 22:22:45,256 INFO L226 Difference]: Without dead ends: 914 [2019-11-06 22:22:45,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-11-06 22:22:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2019-11-06 22:22:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-11-06 22:22:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1421 transitions. [2019-11-06 22:22:45,297 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1421 transitions. Word has length 162 [2019-11-06 22:22:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:45,297 INFO L462 AbstractCegarLoop]: Abstraction has 910 states and 1421 transitions. [2019-11-06 22:22:45,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1421 transitions. [2019-11-06 22:22:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-06 22:22:45,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:45,301 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:45,301 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash -618678002, now seen corresponding path program 1 times [2019-11-06 22:22:45,302 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:45,302 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516627432] [2019-11-06 22:22:45,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-06 22:22:45,360 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516627432] [2019-11-06 22:22:45,360 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:45,360 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:45,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278506047] [2019-11-06 22:22:45,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:45,362 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:45,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:45,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:45,362 INFO L87 Difference]: Start difference. First operand 910 states and 1421 transitions. Second operand 5 states. [2019-11-06 22:22:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:45,620 INFO L93 Difference]: Finished difference Result 1811 states and 2829 transitions. [2019-11-06 22:22:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:45,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-11-06 22:22:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:45,626 INFO L225 Difference]: With dead ends: 1811 [2019-11-06 22:22:45,626 INFO L226 Difference]: Without dead ends: 910 [2019-11-06 22:22:45,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-11-06 22:22:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 906. [2019-11-06 22:22:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-06 22:22:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1407 transitions. [2019-11-06 22:22:45,703 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1407 transitions. Word has length 163 [2019-11-06 22:22:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:45,703 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1407 transitions. [2019-11-06 22:22:45,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1407 transitions. [2019-11-06 22:22:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-06 22:22:45,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:45,708 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:45,708 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:45,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1613187866, now seen corresponding path program 1 times [2019-11-06 22:22:45,708 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:45,709 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968662964] [2019-11-06 22:22:45,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-06 22:22:45,783 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968662964] [2019-11-06 22:22:45,783 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:45,783 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:45,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43434446] [2019-11-06 22:22:45,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:45,785 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:45,786 INFO L87 Difference]: Start difference. First operand 906 states and 1407 transitions. Second operand 5 states. [2019-11-06 22:22:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:46,009 INFO L93 Difference]: Finished difference Result 1871 states and 2909 transitions. [2019-11-06 22:22:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:46,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-11-06 22:22:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:46,014 INFO L225 Difference]: With dead ends: 1871 [2019-11-06 22:22:46,015 INFO L226 Difference]: Without dead ends: 978 [2019-11-06 22:22:46,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-06 22:22:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-11-06 22:22:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-06 22:22:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1505 transitions. [2019-11-06 22:22:46,055 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1505 transitions. Word has length 193 [2019-11-06 22:22:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:46,055 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1505 transitions. [2019-11-06 22:22:46,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1505 transitions. [2019-11-06 22:22:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-06 22:22:46,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:46,059 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:46,059 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:46,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:46,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180736, now seen corresponding path program 1 times [2019-11-06 22:22:46,060 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:46,060 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771889019] [2019-11-06 22:22:46,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-06 22:22:46,128 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771889019] [2019-11-06 22:22:46,129 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:46,129 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:46,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056449963] [2019-11-06 22:22:46,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:46,134 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:46,135 INFO L87 Difference]: Start difference. First operand 974 states and 1505 transitions. Second operand 5 states. [2019-11-06 22:22:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:46,442 INFO L93 Difference]: Finished difference Result 1939 states and 2997 transitions. [2019-11-06 22:22:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:46,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 194 [2019-11-06 22:22:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:46,448 INFO L225 Difference]: With dead ends: 1939 [2019-11-06 22:22:46,448 INFO L226 Difference]: Without dead ends: 974 [2019-11-06 22:22:46,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-06 22:22:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 970. [2019-11-06 22:22:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-11-06 22:22:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1489 transitions. [2019-11-06 22:22:46,500 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1489 transitions. Word has length 194 [2019-11-06 22:22:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:46,501 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1489 transitions. [2019-11-06 22:22:46,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1489 transitions. [2019-11-06 22:22:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-06 22:22:46,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:46,505 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:46,505 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1741358840, now seen corresponding path program 1 times [2019-11-06 22:22:46,508 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:46,508 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123889992] [2019-11-06 22:22:46,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-06 22:22:46,608 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123889992] [2019-11-06 22:22:46,609 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:46,609 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:46,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237369519] [2019-11-06 22:22:46,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:46,610 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:46,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:46,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:46,610 INFO L87 Difference]: Start difference. First operand 970 states and 1489 transitions. Second operand 5 states. [2019-11-06 22:22:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:46,825 INFO L93 Difference]: Finished difference Result 2003 states and 3085 transitions. [2019-11-06 22:22:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:46,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-11-06 22:22:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:46,831 INFO L225 Difference]: With dead ends: 2003 [2019-11-06 22:22:46,831 INFO L226 Difference]: Without dead ends: 1046 [2019-11-06 22:22:46,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-11-06 22:22:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-11-06 22:22:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-11-06 22:22:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1553 transitions. [2019-11-06 22:22:46,875 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1553 transitions. Word has length 212 [2019-11-06 22:22:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:46,875 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1553 transitions. [2019-11-06 22:22:46,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1553 transitions. [2019-11-06 22:22:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-06 22:22:46,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:46,880 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:46,880 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:46,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1179693335, now seen corresponding path program 1 times [2019-11-06 22:22:46,881 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:46,881 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794512907] [2019-11-06 22:22:46,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-06 22:22:46,961 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794512907] [2019-11-06 22:22:46,961 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:46,961 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:46,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201017357] [2019-11-06 22:22:46,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:46,963 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:46,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:46,964 INFO L87 Difference]: Start difference. First operand 1020 states and 1553 transitions. Second operand 5 states. [2019-11-06 22:22:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:47,235 INFO L93 Difference]: Finished difference Result 2053 states and 3131 transitions. [2019-11-06 22:22:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:47,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-11-06 22:22:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:47,242 INFO L225 Difference]: With dead ends: 2053 [2019-11-06 22:22:47,242 INFO L226 Difference]: Without dead ends: 1046 [2019-11-06 22:22:47,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-11-06 22:22:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-11-06 22:22:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-11-06 22:22:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1535 transitions. [2019-11-06 22:22:47,288 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1535 transitions. Word has length 213 [2019-11-06 22:22:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:47,289 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1535 transitions. [2019-11-06 22:22:47,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1535 transitions. [2019-11-06 22:22:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-06 22:22:47,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:47,293 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:47,293 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:47,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2078256648, now seen corresponding path program 1 times [2019-11-06 22:22:47,294 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:47,294 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270585902] [2019-11-06 22:22:47,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-06 22:22:47,366 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270585902] [2019-11-06 22:22:47,366 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:47,366 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:47,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58844548] [2019-11-06 22:22:47,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:47,367 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:47,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:47,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:47,368 INFO L87 Difference]: Start difference. First operand 1020 states and 1535 transitions. Second operand 5 states. [2019-11-06 22:22:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:47,606 INFO L93 Difference]: Finished difference Result 2035 states and 3063 transitions. [2019-11-06 22:22:47,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:47,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2019-11-06 22:22:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:47,611 INFO L225 Difference]: With dead ends: 2035 [2019-11-06 22:22:47,612 INFO L226 Difference]: Without dead ends: 1028 [2019-11-06 22:22:47,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-11-06 22:22:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1020. [2019-11-06 22:22:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-11-06 22:22:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1523 transitions. [2019-11-06 22:22:47,659 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1523 transitions. Word has length 224 [2019-11-06 22:22:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:47,660 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1523 transitions. [2019-11-06 22:22:47,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1523 transitions. [2019-11-06 22:22:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-06 22:22:47,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:47,665 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:47,665 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:47,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:47,665 INFO L82 PathProgramCache]: Analyzing trace with hash -836415730, now seen corresponding path program 1 times [2019-11-06 22:22:47,665 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:47,666 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705098818] [2019-11-06 22:22:47,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-06 22:22:47,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705098818] [2019-11-06 22:22:47,745 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:47,745 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:47,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913930342] [2019-11-06 22:22:47,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:47,746 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:47,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:47,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:47,746 INFO L87 Difference]: Start difference. First operand 1020 states and 1523 transitions. Second operand 5 states. [2019-11-06 22:22:48,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:48,000 INFO L93 Difference]: Finished difference Result 2035 states and 3039 transitions. [2019-11-06 22:22:48,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:48,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-11-06 22:22:48,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:48,005 INFO L225 Difference]: With dead ends: 2035 [2019-11-06 22:22:48,006 INFO L226 Difference]: Without dead ends: 1010 [2019-11-06 22:22:48,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-11-06 22:22:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1002. [2019-11-06 22:22:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-11-06 22:22:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1485 transitions. [2019-11-06 22:22:48,048 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1485 transitions. Word has length 225 [2019-11-06 22:22:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:48,048 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1485 transitions. [2019-11-06 22:22:48,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1485 transitions. [2019-11-06 22:22:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-06 22:22:48,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:48,051 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:48,051 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:48,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:48,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1494389851, now seen corresponding path program 1 times [2019-11-06 22:22:48,052 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:48,052 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126208152] [2019-11-06 22:22:48,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-06 22:22:48,123 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126208152] [2019-11-06 22:22:48,123 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:48,123 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:48,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056951028] [2019-11-06 22:22:48,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:48,124 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:48,125 INFO L87 Difference]: Start difference. First operand 1002 states and 1485 transitions. Second operand 5 states. [2019-11-06 22:22:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:48,332 INFO L93 Difference]: Finished difference Result 2045 states and 3037 transitions. [2019-11-06 22:22:48,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:48,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-11-06 22:22:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:48,337 INFO L225 Difference]: With dead ends: 2045 [2019-11-06 22:22:48,338 INFO L226 Difference]: Without dead ends: 1056 [2019-11-06 22:22:48,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-11-06 22:22:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1048. [2019-11-06 22:22:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-11-06 22:22:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1539 transitions. [2019-11-06 22:22:48,387 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1539 transitions. Word has length 233 [2019-11-06 22:22:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:48,387 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1539 transitions. [2019-11-06 22:22:48,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1539 transitions. [2019-11-06 22:22:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-06 22:22:48,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:48,390 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:48,391 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1829546886, now seen corresponding path program 1 times [2019-11-06 22:22:48,392 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:48,392 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200230589] [2019-11-06 22:22:48,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-06 22:22:48,467 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200230589] [2019-11-06 22:22:48,467 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:48,467 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:48,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108997934] [2019-11-06 22:22:48,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:48,468 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:48,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:48,469 INFO L87 Difference]: Start difference. First operand 1048 states and 1539 transitions. Second operand 5 states. [2019-11-06 22:22:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:48,736 INFO L93 Difference]: Finished difference Result 2091 states and 3071 transitions. [2019-11-06 22:22:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:48,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-11-06 22:22:48,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:48,741 INFO L225 Difference]: With dead ends: 2091 [2019-11-06 22:22:48,741 INFO L226 Difference]: Without dead ends: 1048 [2019-11-06 22:22:48,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-06 22:22:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1040. [2019-11-06 22:22:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-06 22:22:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1507 transitions. [2019-11-06 22:22:48,785 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1507 transitions. Word has length 234 [2019-11-06 22:22:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:48,785 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1507 transitions. [2019-11-06 22:22:48,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1507 transitions. [2019-11-06 22:22:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-06 22:22:48,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:48,789 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:48,789 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash 678328095, now seen corresponding path program 1 times [2019-11-06 22:22:48,789 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:48,790 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630066789] [2019-11-06 22:22:48,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-06 22:22:48,882 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630066789] [2019-11-06 22:22:48,882 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267350861] [2019-11-06 22:22:48,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:49,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:22:49,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-06 22:22:49,141 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:49,143 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:22:49,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866785147] [2019-11-06 22:22:49,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:49,145 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:49,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:49,146 INFO L87 Difference]: Start difference. First operand 1040 states and 1507 transitions. Second operand 3 states. [2019-11-06 22:22:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:49,262 INFO L93 Difference]: Finished difference Result 2579 states and 3740 transitions. [2019-11-06 22:22:49,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:49,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-06 22:22:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:49,270 INFO L225 Difference]: With dead ends: 2579 [2019-11-06 22:22:49,270 INFO L226 Difference]: Without dead ends: 1552 [2019-11-06 22:22:49,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-11-06 22:22:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2019-11-06 22:22:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-11-06 22:22:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2249 transitions. [2019-11-06 22:22:49,391 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2249 transitions. Word has length 270 [2019-11-06 22:22:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:49,392 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 2249 transitions. [2019-11-06 22:22:49,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2249 transitions. [2019-11-06 22:22:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-06 22:22:49,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:49,396 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:49,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:49,597 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:49,598 INFO L82 PathProgramCache]: Analyzing trace with hash -230386138, now seen corresponding path program 1 times [2019-11-06 22:22:49,598 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:49,598 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331016224] [2019-11-06 22:22:49,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-06 22:22:49,747 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331016224] [2019-11-06 22:22:49,748 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:49,748 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:49,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879118928] [2019-11-06 22:22:49,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:49,749 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:49,749 INFO L87 Difference]: Start difference. First operand 1552 states and 2249 transitions. Second operand 3 states. [2019-11-06 22:22:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:49,899 INFO L93 Difference]: Finished difference Result 4547 states and 6592 transitions. [2019-11-06 22:22:49,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:49,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-06 22:22:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:49,917 INFO L225 Difference]: With dead ends: 4547 [2019-11-06 22:22:49,917 INFO L226 Difference]: Without dead ends: 3008 [2019-11-06 22:22:49,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-11-06 22:22:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3007. [2019-11-06 22:22:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3007 states. [2019-11-06 22:22:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4350 transitions. [2019-11-06 22:22:50,098 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4350 transitions. Word has length 278 [2019-11-06 22:22:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:50,099 INFO L462 AbstractCegarLoop]: Abstraction has 3007 states and 4350 transitions. [2019-11-06 22:22:50,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4350 transitions. [2019-11-06 22:22:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-06 22:22:50,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:50,105 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:50,106 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash -860287162, now seen corresponding path program 1 times [2019-11-06 22:22:50,107 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:50,107 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240693826] [2019-11-06 22:22:50,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-06 22:22:50,253 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240693826] [2019-11-06 22:22:50,254 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:50,254 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:50,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962701919] [2019-11-06 22:22:50,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:50,255 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:50,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:50,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:50,255 INFO L87 Difference]: Start difference. First operand 3007 states and 4350 transitions. Second operand 3 states. [2019-11-06 22:22:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:50,530 INFO L93 Difference]: Finished difference Result 6121 states and 8875 transitions. [2019-11-06 22:22:50,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:50,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-11-06 22:22:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:50,541 INFO L225 Difference]: With dead ends: 6121 [2019-11-06 22:22:50,541 INFO L226 Difference]: Without dead ends: 2006 [2019-11-06 22:22:50,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-11-06 22:22:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1986. [2019-11-06 22:22:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-11-06 22:22:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2824 transitions. [2019-11-06 22:22:50,633 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2824 transitions. Word has length 315 [2019-11-06 22:22:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:50,634 INFO L462 AbstractCegarLoop]: Abstraction has 1986 states and 2824 transitions. [2019-11-06 22:22:50,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2824 transitions. [2019-11-06 22:22:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-06 22:22:50,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:50,639 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:50,639 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2044603392, now seen corresponding path program 1 times [2019-11-06 22:22:50,640 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:50,640 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153363929] [2019-11-06 22:22:50,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-11-06 22:22:50,828 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153363929] [2019-11-06 22:22:50,832 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426007814] [2019-11-06 22:22:50,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:50,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-06 22:22:51,123 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:51,123 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:22:51,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245580136] [2019-11-06 22:22:51,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:51,124 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:51,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:51,125 INFO L87 Difference]: Start difference. First operand 1986 states and 2824 transitions. Second operand 3 states. [2019-11-06 22:22:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:51,235 INFO L93 Difference]: Finished difference Result 4612 states and 6551 transitions. [2019-11-06 22:22:51,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:51,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-11-06 22:22:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:51,259 INFO L225 Difference]: With dead ends: 4612 [2019-11-06 22:22:51,259 INFO L226 Difference]: Without dead ends: 2639 [2019-11-06 22:22:51,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-11-06 22:22:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2019-11-06 22:22:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-11-06 22:22:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3738 transitions. [2019-11-06 22:22:51,374 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3738 transitions. Word has length 382 [2019-11-06 22:22:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:51,375 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 3738 transitions. [2019-11-06 22:22:51,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3738 transitions. [2019-11-06 22:22:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-06 22:22:51,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:51,383 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:51,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:51,587 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash 134700959, now seen corresponding path program 1 times [2019-11-06 22:22:51,587 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:51,587 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114502717] [2019-11-06 22:22:51,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-06 22:22:51,843 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114502717] [2019-11-06 22:22:51,843 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987049871] [2019-11-06 22:22:51,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:51,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-11-06 22:22:52,120 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:52,120 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:22:52,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846898224] [2019-11-06 22:22:52,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:52,121 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:52,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:52,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:52,121 INFO L87 Difference]: Start difference. First operand 2639 states and 3738 transitions. Second operand 3 states. [2019-11-06 22:22:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:52,207 INFO L93 Difference]: Finished difference Result 2700 states and 3825 transitions. [2019-11-06 22:22:52,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:52,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-11-06 22:22:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:52,215 INFO L225 Difference]: With dead ends: 2700 [2019-11-06 22:22:52,216 INFO L226 Difference]: Without dead ends: 2106 [2019-11-06 22:22:52,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-11-06 22:22:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2048. [2019-11-06 22:22:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-11-06 22:22:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2908 transitions. [2019-11-06 22:22:52,318 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2908 transitions. Word has length 453 [2019-11-06 22:22:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:52,319 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 2908 transitions. [2019-11-06 22:22:52,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2908 transitions. [2019-11-06 22:22:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-06 22:22:52,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:52,326 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:52,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:52,530 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1776341599, now seen corresponding path program 1 times [2019-11-06 22:22:52,530 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:52,530 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595195318] [2019-11-06 22:22:52,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-06 22:22:52,697 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595195318] [2019-11-06 22:22:52,697 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656809008] [2019-11-06 22:22:52,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:52,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-06 22:22:53,117 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:53,118 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:53,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211208798] [2019-11-06 22:22:53,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:53,121 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:53,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:53,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:53,122 INFO L87 Difference]: Start difference. First operand 2048 states and 2908 transitions. Second operand 4 states. [2019-11-06 22:22:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:53,450 INFO L93 Difference]: Finished difference Result 4236 states and 6005 transitions. [2019-11-06 22:22:53,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:53,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 453 [2019-11-06 22:22:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:53,463 INFO L225 Difference]: With dead ends: 4236 [2019-11-06 22:22:53,464 INFO L226 Difference]: Without dead ends: 2157 [2019-11-06 22:22:53,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-11-06 22:22:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1910. [2019-11-06 22:22:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-11-06 22:22:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2609 transitions. [2019-11-06 22:22:53,548 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2609 transitions. Word has length 453 [2019-11-06 22:22:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:53,549 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2609 transitions. [2019-11-06 22:22:53,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2609 transitions. [2019-11-06 22:22:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-11-06 22:22:53,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:53,559 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:53,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:53,763 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:53,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1812552048, now seen corresponding path program 1 times [2019-11-06 22:22:53,764 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:53,764 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883220327] [2019-11-06 22:22:53,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-06 22:22:54,325 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883220327] [2019-11-06 22:22:54,325 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593603715] [2019-11-06 22:22:54,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:54,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:54,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-06 22:22:54,867 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:54,867 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:54,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511326657] [2019-11-06 22:22:54,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:54,869 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:54,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:54,869 INFO L87 Difference]: Start difference. First operand 1910 states and 2609 transitions. Second operand 4 states. [2019-11-06 22:22:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:55,139 INFO L93 Difference]: Finished difference Result 4572 states and 6296 transitions. [2019-11-06 22:22:55,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:55,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 854 [2019-11-06 22:22:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:55,146 INFO L225 Difference]: With dead ends: 4572 [2019-11-06 22:22:55,147 INFO L226 Difference]: Without dead ends: 2540 [2019-11-06 22:22:55,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2019-11-06 22:22:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 1910. [2019-11-06 22:22:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-11-06 22:22:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2609 transitions. [2019-11-06 22:22:55,230 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2609 transitions. Word has length 854 [2019-11-06 22:22:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:55,231 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2609 transitions. [2019-11-06 22:22:55,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2609 transitions. [2019-11-06 22:22:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2019-11-06 22:22:55,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:55,244 INFO L410 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:55,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:55,450 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1607522492, now seen corresponding path program 1 times [2019-11-06 22:22:55,451 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:55,451 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175940811] [2019-11-06 22:22:55,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-11-06 22:22:56,167 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175940811] [2019-11-06 22:22:56,167 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:56,167 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:56,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11449171] [2019-11-06 22:22:56,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:56,169 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:56,169 INFO L87 Difference]: Start difference. First operand 1910 states and 2609 transitions. Second operand 3 states. [2019-11-06 22:22:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:56,358 INFO L93 Difference]: Finished difference Result 3841 states and 5240 transitions. [2019-11-06 22:22:56,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:56,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1035 [2019-11-06 22:22:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:56,363 INFO L225 Difference]: With dead ends: 3841 [2019-11-06 22:22:56,363 INFO L226 Difference]: Without dead ends: 1950 [2019-11-06 22:22:56,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-06 22:22:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1910. [2019-11-06 22:22:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-11-06 22:22:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2589 transitions. [2019-11-06 22:22:56,445 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2589 transitions. Word has length 1035 [2019-11-06 22:22:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:56,446 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2589 transitions. [2019-11-06 22:22:56,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2589 transitions. [2019-11-06 22:22:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2019-11-06 22:22:56,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:56,459 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:56,459 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash 123556935, now seen corresponding path program 1 times [2019-11-06 22:22:56,460 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:56,460 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397419310] [2019-11-06 22:22:56,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-11-06 22:22:56,990 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397419310] [2019-11-06 22:22:56,990 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:56,990 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:56,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088412995] [2019-11-06 22:22:56,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:56,992 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:56,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:56,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:56,992 INFO L87 Difference]: Start difference. First operand 1910 states and 2589 transitions. Second operand 3 states. [2019-11-06 22:22:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:57,150 INFO L93 Difference]: Finished difference Result 3818 states and 5174 transitions. [2019-11-06 22:22:57,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:57,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1050 [2019-11-06 22:22:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:57,154 INFO L225 Difference]: With dead ends: 3818 [2019-11-06 22:22:57,154 INFO L226 Difference]: Without dead ends: 1927 [2019-11-06 22:22:57,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2019-11-06 22:22:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1910. [2019-11-06 22:22:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-11-06 22:22:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2549 transitions. [2019-11-06 22:22:57,237 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2549 transitions. Word has length 1050 [2019-11-06 22:22:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:57,238 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2549 transitions. [2019-11-06 22:22:57,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2549 transitions. [2019-11-06 22:22:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2019-11-06 22:22:57,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:57,251 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:57,251 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:57,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash 860689758, now seen corresponding path program 1 times [2019-11-06 22:22:57,252 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:57,252 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018251580] [2019-11-06 22:22:57,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-11-06 22:22:58,189 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018251580] [2019-11-06 22:22:58,189 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:58,189 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:58,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589199892] [2019-11-06 22:22:58,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:58,191 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:58,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:58,191 INFO L87 Difference]: Start difference. First operand 1910 states and 2549 transitions. Second operand 3 states. [2019-11-06 22:22:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:58,368 INFO L93 Difference]: Finished difference Result 3871 states and 5171 transitions. [2019-11-06 22:22:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:58,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1078 [2019-11-06 22:22:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:58,373 INFO L225 Difference]: With dead ends: 3871 [2019-11-06 22:22:58,373 INFO L226 Difference]: Without dead ends: 1962 [2019-11-06 22:22:58,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-06 22:22:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1952. [2019-11-06 22:22:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-11-06 22:22:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2597 transitions. [2019-11-06 22:22:58,450 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2597 transitions. Word has length 1078 [2019-11-06 22:22:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:58,451 INFO L462 AbstractCegarLoop]: Abstraction has 1952 states and 2597 transitions. [2019-11-06 22:22:58,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2597 transitions. [2019-11-06 22:22:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-11-06 22:22:58,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:58,464 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:58,464 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1775510994, now seen corresponding path program 1 times [2019-11-06 22:22:58,465 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:58,465 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58933937] [2019-11-06 22:22:58,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-11-06 22:22:59,009 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58933937] [2019-11-06 22:22:59,009 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:59,010 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:59,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612325795] [2019-11-06 22:22:59,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:59,011 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:59,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:59,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:59,011 INFO L87 Difference]: Start difference. First operand 1952 states and 2597 transitions. Second operand 3 states. [2019-11-06 22:22:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:59,144 INFO L93 Difference]: Finished difference Result 2520 states and 3342 transitions. [2019-11-06 22:22:59,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:59,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1110 [2019-11-06 22:22:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:59,146 INFO L225 Difference]: With dead ends: 2520 [2019-11-06 22:22:59,146 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:22:59,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:22:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:22:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:22:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:22:59,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2019-11-06 22:22:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:59,154 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:22:59,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:22:59,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:22:59,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:22:59,905 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 183 [2019-11-06 22:23:00,689 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 180 [2019-11-06 22:23:02,227 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-11-06 22:23:03,412 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-11-06 22:23:04,291 WARN L191 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2019-11-06 22:23:06,159 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 175 DAG size of output: 107 [2019-11-06 22:23:06,996 WARN L191 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 121 [2019-11-06 22:23:07,972 WARN L191 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 123 [2019-11-06 22:23:08,433 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2019-11-06 22:23:09,602 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-11-06 22:23:10,436 WARN L191 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117