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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:56:37,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:56:37,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:56:37,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:56:37,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:56:37,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:56:37,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:56:37,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:56:37,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:56:37,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:56:37,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:56:37,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:56:37,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:56:37,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:56:37,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:56:37,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:56:37,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:56:37,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:56:37,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:56:37,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:56:37,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:56:37,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:56:37,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:56:37,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:56:37,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:56:37,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:56:37,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:56:37,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:56:37,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:56:37,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:56:37,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:56:37,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:56:37,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:56:37,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:56:37,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:56:37,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:56:37,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:56:37,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:56:37,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:56:37,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:56:37,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:56:37,831 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:56:37,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:56:37,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:56:37,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:56:37,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:56:37,855 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:56:37,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:56:37,856 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:56:37,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:56:37,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:56:37,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:56:37,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:56:37,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:56:37,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:56:37,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:56:37,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:56:37,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:56:37,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:56:37,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:56:37,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:56:37,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:56:37,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:56:37,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:56:37,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:56:37,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:56:37,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:56:37,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:56:37,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:56:37,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:56:37,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:56:37,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:56:37,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:56:37,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:56:37,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:56:37,913 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:56:37,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 14:56:37,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a17e0889/d841c736645046aabeece789cb41f5c3/FLAG8b3336055 [2019-10-02 14:56:38,601 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:56:38,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 14:56:38,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a17e0889/d841c736645046aabeece789cb41f5c3/FLAG8b3336055 [2019-10-02 14:56:38,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a17e0889/d841c736645046aabeece789cb41f5c3 [2019-10-02 14:56:38,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:56:38,851 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:56:38,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:56:38,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:56:38,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:56:38,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:56:38" (1/1) ... [2019-10-02 14:56:38,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77676ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:38, skipping insertion in model container [2019-10-02 14:56:38,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:56:38" (1/1) ... [2019-10-02 14:56:38,867 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:56:38,959 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:56:39,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:56:39,762 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:56:40,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:56:40,109 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:56:40,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40 WrapperNode [2019-10-02 14:56:40,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:56:40,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:56:40,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:56:40,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:56:40,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (1/1) ... [2019-10-02 14:56:40,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (1/1) ... [2019-10-02 14:56:40,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (1/1) ... [2019-10-02 14:56:40,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (1/1) ... [2019-10-02 14:56:40,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (1/1) ... [2019-10-02 14:56:40,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (1/1) ... [2019-10-02 14:56:40,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (1/1) ... [2019-10-02 14:56:40,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:56:40,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:56:40,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:56:40,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:56:40,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:56:40,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:56:40,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:56:40,322 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:56:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:56:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:56:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:56:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 14:56:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:56:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:56:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:56:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:56:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:56:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:56:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:56:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:56:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:56:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:56:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:56:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:56:42,288 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:56:42,288 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:56:42,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:56:42 BoogieIcfgContainer [2019-10-02 14:56:42,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:56:42,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:56:42,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:56:42,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:56:42,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:56:38" (1/3) ... [2019-10-02 14:56:42,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610462d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:56:42, skipping insertion in model container [2019-10-02 14:56:42,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:40" (2/3) ... [2019-10-02 14:56:42,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610462d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:56:42, skipping insertion in model container [2019-10-02 14:56:42,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:56:42" (3/3) ... [2019-10-02 14:56:42,303 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 14:56:42,317 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:56:42,328 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-02 14:56:42,352 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-02 14:56:42,409 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:56:42,410 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:56:42,410 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:56:42,411 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:56:42,411 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:56:42,411 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:56:42,411 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:56:42,411 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:56:42,411 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:56:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states. [2019-10-02 14:56:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 14:56:42,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:42,489 INFO L411 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, 1] [2019-10-02 14:56:42,492 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash -437253728, now seen corresponding path program 1 times [2019-10-02 14:56:42,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:42,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:42,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:43,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:43,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:43,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:43,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:43,043 INFO L87 Difference]: Start difference. First operand 446 states. Second operand 3 states. [2019-10-02 14:56:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:43,207 INFO L93 Difference]: Finished difference Result 701 states and 1229 transitions. [2019-10-02 14:56:43,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:43,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-02 14:56:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:43,242 INFO L225 Difference]: With dead ends: 701 [2019-10-02 14:56:43,242 INFO L226 Difference]: Without dead ends: 544 [2019-10-02 14:56:43,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-10-02 14:56:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 538. [2019-10-02 14:56:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-02 14:56:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 713 transitions. [2019-10-02 14:56:43,335 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 713 transitions. Word has length 53 [2019-10-02 14:56:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:43,336 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 713 transitions. [2019-10-02 14:56:43,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 713 transitions. [2019-10-02 14:56:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 14:56:43,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:43,339 INFO L411 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, 1] [2019-10-02 14:56:43,340 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:43,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash 511312781, now seen corresponding path program 1 times [2019-10-02 14:56:43,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:43,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:43,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:43,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:43,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:43,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:43,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:43,496 INFO L87 Difference]: Start difference. First operand 538 states and 713 transitions. Second operand 3 states. [2019-10-02 14:56:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:43,598 INFO L93 Difference]: Finished difference Result 939 states and 1299 transitions. [2019-10-02 14:56:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:43,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-02 14:56:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:43,605 INFO L225 Difference]: With dead ends: 939 [2019-10-02 14:56:43,606 INFO L226 Difference]: Without dead ends: 717 [2019-10-02 14:56:43,611 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-02 14:56:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 711. [2019-10-02 14:56:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-02 14:56:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 964 transitions. [2019-10-02 14:56:43,671 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 964 transitions. Word has length 53 [2019-10-02 14:56:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:43,672 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 964 transitions. [2019-10-02 14:56:43,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 964 transitions. [2019-10-02 14:56:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 14:56:43,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:43,677 INFO L411 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, 1] [2019-10-02 14:56:43,678 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2083769958, now seen corresponding path program 1 times [2019-10-02 14:56:43,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:43,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:43,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:43,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:43,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:43,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:43,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:56:43,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:56:43,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:56:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:56:43,998 INFO L87 Difference]: Start difference. First operand 711 states and 964 transitions. Second operand 10 states. [2019-10-02 14:56:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:46,103 INFO L93 Difference]: Finished difference Result 2245 states and 3240 transitions. [2019-10-02 14:56:46,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:56:46,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-02 14:56:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:46,116 INFO L225 Difference]: With dead ends: 2245 [2019-10-02 14:56:46,116 INFO L226 Difference]: Without dead ends: 2114 [2019-10-02 14:56:46,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:56:46,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-10-02 14:56:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 722. [2019-10-02 14:56:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-02 14:56:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 978 transitions. [2019-10-02 14:56:46,181 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 978 transitions. Word has length 53 [2019-10-02 14:56:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:46,184 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 978 transitions. [2019-10-02 14:56:46,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:56:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 978 transitions. [2019-10-02 14:56:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:56:46,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:46,187 INFO L411 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, 1, 1] [2019-10-02 14:56:46,188 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash -952135619, now seen corresponding path program 1 times [2019-10-02 14:56:46,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:46,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:46,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:46,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:46,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:46,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:46,313 INFO L87 Difference]: Start difference. First operand 722 states and 978 transitions. Second operand 3 states. [2019-10-02 14:56:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:46,454 INFO L93 Difference]: Finished difference Result 1389 states and 1943 transitions. [2019-10-02 14:56:46,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:46,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-02 14:56:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:46,461 INFO L225 Difference]: With dead ends: 1389 [2019-10-02 14:56:46,461 INFO L226 Difference]: Without dead ends: 1060 [2019-10-02 14:56:46,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-02 14:56:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1053. [2019-10-02 14:56:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-02 14:56:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-10-02 14:56:46,519 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-10-02 14:56:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:46,519 INFO L475 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-10-02 14:56:46,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-10-02 14:56:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:56:46,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:46,522 INFO L411 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, 1, 1] [2019-10-02 14:56:46,523 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:46,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:46,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1058176550, now seen corresponding path program 1 times [2019-10-02 14:56:46,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:46,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:46,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:46,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:46,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:46,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:56:46,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:56:46,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:56:46,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:56:46,677 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 10 states. [2019-10-02 14:56:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:48,558 INFO L93 Difference]: Finished difference Result 2584 states and 3635 transitions. [2019-10-02 14:56:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:56:48,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-02 14:56:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:48,573 INFO L225 Difference]: With dead ends: 2584 [2019-10-02 14:56:48,573 INFO L226 Difference]: Without dead ends: 2367 [2019-10-02 14:56:48,575 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:56:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-10-02 14:56:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1053. [2019-10-02 14:56:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-02 14:56:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-10-02 14:56:48,658 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-10-02 14:56:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:48,659 INFO L475 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-10-02 14:56:48,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:56:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-10-02 14:56:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:56:48,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:48,662 INFO L411 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, 1, 1] [2019-10-02 14:56:48,662 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash -609407585, now seen corresponding path program 1 times [2019-10-02 14:56:48,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:48,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:48,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:48,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:48,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:48,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:48,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 14:56:48,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:56:48,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:56:48,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:56:48,900 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 12 states. [2019-10-02 14:56:49,021 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-10-02 14:56:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:52,221 INFO L93 Difference]: Finished difference Result 3802 states and 5406 transitions. [2019-10-02 14:56:52,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:56:52,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-02 14:56:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:52,239 INFO L225 Difference]: With dead ends: 3802 [2019-10-02 14:56:52,239 INFO L226 Difference]: Without dead ends: 3604 [2019-10-02 14:56:52,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:56:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2019-10-02 14:56:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 1069. [2019-10-02 14:56:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-02 14:56:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1467 transitions. [2019-10-02 14:56:52,345 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1467 transitions. Word has length 54 [2019-10-02 14:56:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:52,346 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1467 transitions. [2019-10-02 14:56:52,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:56:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1467 transitions. [2019-10-02 14:56:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:56:52,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:52,348 INFO L411 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, 1, 1] [2019-10-02 14:56:52,349 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 963049592, now seen corresponding path program 1 times [2019-10-02 14:56:52,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:52,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:52,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:52,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:52,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:52,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:52,490 INFO L87 Difference]: Start difference. First operand 1069 states and 1467 transitions. Second operand 9 states. [2019-10-02 14:56:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:53,844 INFO L93 Difference]: Finished difference Result 4058 states and 5764 transitions. [2019-10-02 14:56:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:56:53,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-02 14:56:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:53,860 INFO L225 Difference]: With dead ends: 4058 [2019-10-02 14:56:53,860 INFO L226 Difference]: Without dead ends: 3298 [2019-10-02 14:56:53,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:56:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-10-02 14:56:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 2389. [2019-10-02 14:56:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2019-10-02 14:56:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3394 transitions. [2019-10-02 14:56:54,064 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3394 transitions. Word has length 54 [2019-10-02 14:56:54,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:54,065 INFO L475 AbstractCegarLoop]: Abstraction has 2389 states and 3394 transitions. [2019-10-02 14:56:54,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3394 transitions. [2019-10-02 14:56:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:56:54,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:54,069 INFO L411 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, 1, 1, 1] [2019-10-02 14:56:54,069 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:54,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1344826450, now seen corresponding path program 1 times [2019-10-02 14:56:54,070 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:54,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:54,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:54,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:54,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:56:54,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:56:54,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:56:54,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:54,167 INFO L87 Difference]: Start difference. First operand 2389 states and 3394 transitions. Second operand 7 states. [2019-10-02 14:56:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:55,731 INFO L93 Difference]: Finished difference Result 7376 states and 10821 transitions. [2019-10-02 14:56:55,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:55,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-02 14:56:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:55,757 INFO L225 Difference]: With dead ends: 7376 [2019-10-02 14:56:55,757 INFO L226 Difference]: Without dead ends: 6979 [2019-10-02 14:56:55,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:56:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-10-02 14:56:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 2390. [2019-10-02 14:56:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-10-02 14:56:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3396 transitions. [2019-10-02 14:56:56,037 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3396 transitions. Word has length 55 [2019-10-02 14:56:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:56,037 INFO L475 AbstractCegarLoop]: Abstraction has 2390 states and 3396 transitions. [2019-10-02 14:56:56,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:56:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3396 transitions. [2019-10-02 14:56:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:56:56,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:56,042 INFO L411 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, 1, 1, 1] [2019-10-02 14:56:56,042 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 698198403, now seen corresponding path program 1 times [2019-10-02 14:56:56,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:56,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:56,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:56,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:56,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:56,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:56,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:56,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:56,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:56,168 INFO L87 Difference]: Start difference. First operand 2390 states and 3396 transitions. Second operand 9 states. [2019-10-02 14:56:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:57,984 INFO L93 Difference]: Finished difference Result 6722 states and 9758 transitions. [2019-10-02 14:56:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:57,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-02 14:56:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:58,009 INFO L225 Difference]: With dead ends: 6722 [2019-10-02 14:56:58,010 INFO L226 Difference]: Without dead ends: 6171 [2019-10-02 14:56:58,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:56:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2019-10-02 14:56:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 2405. [2019-10-02 14:56:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-10-02 14:56:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3418 transitions. [2019-10-02 14:56:58,291 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3418 transitions. Word has length 55 [2019-10-02 14:56:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:58,292 INFO L475 AbstractCegarLoop]: Abstraction has 2405 states and 3418 transitions. [2019-10-02 14:56:58,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3418 transitions. [2019-10-02 14:56:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:56:58,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:58,296 INFO L411 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, 1, 1, 1] [2019-10-02 14:56:58,296 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:58,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2110452651, now seen corresponding path program 1 times [2019-10-02 14:56:58,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:58,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:58,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:58,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:58,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:58,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:58,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:56:58,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:56:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:56:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:56:58,379 INFO L87 Difference]: Start difference. First operand 2405 states and 3418 transitions. Second operand 6 states. [2019-10-02 14:56:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:58,912 INFO L93 Difference]: Finished difference Result 4138 states and 5959 transitions. [2019-10-02 14:56:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:58,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-02 14:56:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:58,919 INFO L225 Difference]: With dead ends: 4138 [2019-10-02 14:56:58,919 INFO L226 Difference]: Without dead ends: 2372 [2019-10-02 14:56:58,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:56:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-10-02 14:56:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1715. [2019-10-02 14:56:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-02 14:56:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-10-02 14:56:59,134 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-10-02 14:56:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:59,135 INFO L475 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-10-02 14:56:59,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:56:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-10-02 14:56:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:56:59,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:59,138 INFO L411 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, 1, 1, 1] [2019-10-02 14:56:59,138 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:59,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1073379538, now seen corresponding path program 1 times [2019-10-02 14:56:59,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:59,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:59,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:59,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:59,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:59,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:59,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:56:59,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:56:59,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:56:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:56:59,252 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 10 states. [2019-10-02 14:57:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:02,902 INFO L93 Difference]: Finished difference Result 8298 states and 11986 transitions. [2019-10-02 14:57:02,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:57:02,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-02 14:57:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:02,919 INFO L225 Difference]: With dead ends: 8298 [2019-10-02 14:57:02,919 INFO L226 Difference]: Without dead ends: 7766 [2019-10-02 14:57:02,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:57:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-10-02 14:57:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 1715. [2019-10-02 14:57:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-02 14:57:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-10-02 14:57:03,252 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-10-02 14:57:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:03,253 INFO L475 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-10-02 14:57:03,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:57:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-10-02 14:57:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:57:03,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:03,256 INFO L411 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, 1, 1, 1] [2019-10-02 14:57:03,256 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash -603462302, now seen corresponding path program 1 times [2019-10-02 14:57:03,257 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:03,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:03,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:03,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:03,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:57:03,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:57:03,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:57:03,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:03,441 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 9 states. [2019-10-02 14:57:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:05,211 INFO L93 Difference]: Finished difference Result 7723 states and 11113 transitions. [2019-10-02 14:57:05,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:57:05,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-02 14:57:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:05,263 INFO L225 Difference]: With dead ends: 7723 [2019-10-02 14:57:05,263 INFO L226 Difference]: Without dead ends: 6251 [2019-10-02 14:57:05,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:57:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-10-02 14:57:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 4360. [2019-10-02 14:57:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4360 states. [2019-10-02 14:57:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 6289 transitions. [2019-10-02 14:57:05,911 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 6289 transitions. Word has length 55 [2019-10-02 14:57:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:05,911 INFO L475 AbstractCegarLoop]: Abstraction has 4360 states and 6289 transitions. [2019-10-02 14:57:05,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:57:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 6289 transitions. [2019-10-02 14:57:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:57:05,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:05,916 INFO L411 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, 1, 1, 1] [2019-10-02 14:57:05,916 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:05,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1551481955, now seen corresponding path program 1 times [2019-10-02 14:57:05,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:05,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:06,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:06,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:57:06,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:57:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:57:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:06,021 INFO L87 Difference]: Start difference. First operand 4360 states and 6289 transitions. Second operand 9 states. [2019-10-02 14:57:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:10,195 INFO L93 Difference]: Finished difference Result 15997 states and 22784 transitions. [2019-10-02 14:57:10,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:57:10,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-02 14:57:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:10,214 INFO L225 Difference]: With dead ends: 15997 [2019-10-02 14:57:10,214 INFO L226 Difference]: Without dead ends: 14521 [2019-10-02 14:57:10,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:57:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14521 states. [2019-10-02 14:57:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14521 to 4374. [2019-10-02 14:57:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-10-02 14:57:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 6307 transitions. [2019-10-02 14:57:10,969 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 6307 transitions. Word has length 55 [2019-10-02 14:57:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:10,969 INFO L475 AbstractCegarLoop]: Abstraction has 4374 states and 6307 transitions. [2019-10-02 14:57:10,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:57:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 6307 transitions. [2019-10-02 14:57:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:57:10,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:10,974 INFO L411 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, 1, 1, 1, 1] [2019-10-02 14:57:10,974 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1949047105, now seen corresponding path program 1 times [2019-10-02 14:57:10,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:10,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:10,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:11,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:11,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:57:11,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:57:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:57:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:57:11,075 INFO L87 Difference]: Start difference. First operand 4374 states and 6307 transitions. Second operand 7 states. [2019-10-02 14:57:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:14,228 INFO L93 Difference]: Finished difference Result 14683 states and 21505 transitions. [2019-10-02 14:57:14,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:57:14,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-02 14:57:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:14,241 INFO L225 Difference]: With dead ends: 14683 [2019-10-02 14:57:14,241 INFO L226 Difference]: Without dead ends: 13322 [2019-10-02 14:57:14,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:57:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13322 states. [2019-10-02 14:57:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13322 to 4374. [2019-10-02 14:57:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-10-02 14:57:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 6307 transitions. [2019-10-02 14:57:15,252 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 6307 transitions. Word has length 56 [2019-10-02 14:57:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:15,252 INFO L475 AbstractCegarLoop]: Abstraction has 4374 states and 6307 transitions. [2019-10-02 14:57:15,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:57:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 6307 transitions. [2019-10-02 14:57:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:57:15,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:15,257 INFO L411 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, 1, 1, 1, 1] [2019-10-02 14:57:15,257 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash -277042014, now seen corresponding path program 1 times [2019-10-02 14:57:15,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:15,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:15,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:15,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:15,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:57:15,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:57:15,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:57:15,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:57:15,340 INFO L87 Difference]: Start difference. First operand 4374 states and 6307 transitions. Second operand 6 states. [2019-10-02 14:57:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:16,371 INFO L93 Difference]: Finished difference Result 8109 states and 11796 transitions. [2019-10-02 14:57:16,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:16,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 14:57:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:16,377 INFO L225 Difference]: With dead ends: 8109 [2019-10-02 14:57:16,377 INFO L226 Difference]: Without dead ends: 4554 [2019-10-02 14:57:16,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:57:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-10-02 14:57:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 3174. [2019-10-02 14:57:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-02 14:57:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4530 transitions. [2019-10-02 14:57:17,041 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4530 transitions. Word has length 56 [2019-10-02 14:57:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:17,041 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 4530 transitions. [2019-10-02 14:57:17,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:57:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4530 transitions. [2019-10-02 14:57:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:57:17,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:17,043 INFO L411 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, 1, 1, 1, 1] [2019-10-02 14:57:17,044 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:17,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1186418740, now seen corresponding path program 1 times [2019-10-02 14:57:17,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:17,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:17,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:17,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:17,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:57:17,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:57:17,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:57:17,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:57:17,160 INFO L87 Difference]: Start difference. First operand 3174 states and 4530 transitions. Second operand 7 states. [2019-10-02 14:57:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:19,504 INFO L93 Difference]: Finished difference Result 10474 states and 15174 transitions. [2019-10-02 14:57:19,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:57:19,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-02 14:57:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:19,515 INFO L225 Difference]: With dead ends: 10474 [2019-10-02 14:57:19,515 INFO L226 Difference]: Without dead ends: 9043 [2019-10-02 14:57:19,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:57:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9043 states. [2019-10-02 14:57:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9043 to 3174. [2019-10-02 14:57:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-02 14:57:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4530 transitions. [2019-10-02 14:57:20,183 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4530 transitions. Word has length 56 [2019-10-02 14:57:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:20,183 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 4530 transitions. [2019-10-02 14:57:20,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:57:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4530 transitions. [2019-10-02 14:57:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:57:20,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:20,186 INFO L411 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, 1, 1, 1, 1] [2019-10-02 14:57:20,186 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash -901593820, now seen corresponding path program 1 times [2019-10-02 14:57:20,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:20,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:20,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:20,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:20,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:57:20,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:57:20,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:57:20,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:20,254 INFO L87 Difference]: Start difference. First operand 3174 states and 4530 transitions. Second operand 5 states. [2019-10-02 14:57:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:21,233 INFO L93 Difference]: Finished difference Result 7259 states and 10417 transitions. [2019-10-02 14:57:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:21,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-02 14:57:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:21,238 INFO L225 Difference]: With dead ends: 7259 [2019-10-02 14:57:21,239 INFO L226 Difference]: Without dead ends: 4263 [2019-10-02 14:57:21,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:57:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2019-10-02 14:57:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 3115. [2019-10-02 14:57:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2019-10-02 14:57:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4421 transitions. [2019-10-02 14:57:21,879 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4421 transitions. Word has length 56 [2019-10-02 14:57:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:21,879 INFO L475 AbstractCegarLoop]: Abstraction has 3115 states and 4421 transitions. [2019-10-02 14:57:21,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:57:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4421 transitions. [2019-10-02 14:57:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:57:21,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:21,880 INFO L411 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, 1, 1, 1, 1, 1] [2019-10-02 14:57:21,881 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -977617656, now seen corresponding path program 1 times [2019-10-02 14:57:21,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:21,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:21,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:21,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:22,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:22,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:57:22,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:57:22,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:57:22,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:22,069 INFO L87 Difference]: Start difference. First operand 3115 states and 4421 transitions. Second operand 9 states. [2019-10-02 14:57:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:25,088 INFO L93 Difference]: Finished difference Result 12224 states and 17809 transitions. [2019-10-02 14:57:25,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:57:25,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-02 14:57:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:25,098 INFO L225 Difference]: With dead ends: 12224 [2019-10-02 14:57:25,098 INFO L226 Difference]: Without dead ends: 10040 [2019-10-02 14:57:25,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:57:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10040 states. [2019-10-02 14:57:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10040 to 3081. [2019-10-02 14:57:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-10-02 14:57:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4375 transitions. [2019-10-02 14:57:25,688 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4375 transitions. Word has length 57 [2019-10-02 14:57:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:25,689 INFO L475 AbstractCegarLoop]: Abstraction has 3081 states and 4375 transitions. [2019-10-02 14:57:25,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:57:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4375 transitions. [2019-10-02 14:57:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:57:25,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:25,690 INFO L411 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, 1, 1, 1, 1, 1] [2019-10-02 14:57:25,690 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2031678240, now seen corresponding path program 1 times [2019-10-02 14:57:25,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:25,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:25,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:25,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:25,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:25,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:25,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:57:25,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:57:25,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:57:25,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:25,890 INFO L87 Difference]: Start difference. First operand 3081 states and 4375 transitions. Second operand 9 states. [2019-10-02 14:57:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:29,048 INFO L93 Difference]: Finished difference Result 6848 states and 9909 transitions. [2019-10-02 14:57:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:57:29,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-02 14:57:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:29,056 INFO L225 Difference]: With dead ends: 6848 [2019-10-02 14:57:29,056 INFO L226 Difference]: Without dead ends: 6843 [2019-10-02 14:57:29,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:57:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6843 states. [2019-10-02 14:57:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6843 to 3081. [2019-10-02 14:57:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-10-02 14:57:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4373 transitions. [2019-10-02 14:57:29,695 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4373 transitions. Word has length 57 [2019-10-02 14:57:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:29,695 INFO L475 AbstractCegarLoop]: Abstraction has 3081 states and 4373 transitions. [2019-10-02 14:57:29,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:57:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4373 transitions. [2019-10-02 14:57:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:57:29,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:29,697 INFO L411 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, 1, 1, 1, 1, 1] [2019-10-02 14:57:29,697 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:29,698 INFO L82 PathProgramCache]: Analyzing trace with hash -29051147, now seen corresponding path program 1 times [2019-10-02 14:57:29,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:29,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:29,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:29,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:57:29,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:57:29,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:57:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:57:29,836 INFO L87 Difference]: Start difference. First operand 3081 states and 4373 transitions. Second operand 8 states. [2019-10-02 14:57:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:32,016 INFO L93 Difference]: Finished difference Result 8262 states and 11911 transitions. [2019-10-02 14:57:32,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:57:32,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-02 14:57:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:32,021 INFO L225 Difference]: With dead ends: 8262 [2019-10-02 14:57:32,022 INFO L226 Difference]: Without dead ends: 5806 [2019-10-02 14:57:32,024 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:57:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5806 states. [2019-10-02 14:57:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5806 to 3081. [2019-10-02 14:57:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-10-02 14:57:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4368 transitions. [2019-10-02 14:57:32,613 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4368 transitions. Word has length 57 [2019-10-02 14:57:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:32,613 INFO L475 AbstractCegarLoop]: Abstraction has 3081 states and 4368 transitions. [2019-10-02 14:57:32,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:57:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4368 transitions. [2019-10-02 14:57:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:57:32,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:32,615 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:32,615 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash -640368532, now seen corresponding path program 1 times [2019-10-02 14:57:32,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:32,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:32,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:32,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:32,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:32,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:32,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:32,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:32,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:32,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:32,671 INFO L87 Difference]: Start difference. First operand 3081 states and 4368 transitions. Second operand 3 states. [2019-10-02 14:57:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:33,284 INFO L93 Difference]: Finished difference Result 4215 states and 5977 transitions. [2019-10-02 14:57:33,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:33,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 14:57:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:33,288 INFO L225 Difference]: With dead ends: 4215 [2019-10-02 14:57:33,289 INFO L226 Difference]: Without dead ends: 2976 [2019-10-02 14:57:33,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2019-10-02 14:57:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2974. [2019-10-02 14:57:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-02 14:57:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4142 transitions. [2019-10-02 14:57:33,901 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4142 transitions. Word has length 58 [2019-10-02 14:57:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:33,901 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4142 transitions. [2019-10-02 14:57:33,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4142 transitions. [2019-10-02 14:57:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:57:33,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:33,904 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:33,904 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:33,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash 489288881, now seen corresponding path program 1 times [2019-10-02 14:57:33,905 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:33,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:33,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:33,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:33,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:33,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:33,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:33,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:33,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:33,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:33,972 INFO L87 Difference]: Start difference. First operand 2974 states and 4142 transitions. Second operand 3 states. [2019-10-02 14:57:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:34,703 INFO L93 Difference]: Finished difference Result 4273 states and 5985 transitions. [2019-10-02 14:57:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:34,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 14:57:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:34,708 INFO L225 Difference]: With dead ends: 4273 [2019-10-02 14:57:34,708 INFO L226 Difference]: Without dead ends: 2981 [2019-10-02 14:57:34,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-10-02 14:57:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2974. [2019-10-02 14:57:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-02 14:57:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4089 transitions. [2019-10-02 14:57:35,277 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4089 transitions. Word has length 58 [2019-10-02 14:57:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:35,277 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4089 transitions. [2019-10-02 14:57:35,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4089 transitions. [2019-10-02 14:57:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:57:35,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:35,279 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:35,279 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:35,280 INFO L82 PathProgramCache]: Analyzing trace with hash 599045577, now seen corresponding path program 1 times [2019-10-02 14:57:35,280 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:35,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:35,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:35,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:35,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:35,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:35,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:35,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:35,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:35,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:35,331 INFO L87 Difference]: Start difference. First operand 2974 states and 4089 transitions. Second operand 3 states. [2019-10-02 14:57:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:35,967 INFO L93 Difference]: Finished difference Result 4326 states and 5976 transitions. [2019-10-02 14:57:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 14:57:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:35,970 INFO L225 Difference]: With dead ends: 4326 [2019-10-02 14:57:35,970 INFO L226 Difference]: Without dead ends: 2980 [2019-10-02 14:57:35,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2019-10-02 14:57:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2974. [2019-10-02 14:57:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-02 14:57:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4043 transitions. [2019-10-02 14:57:36,599 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4043 transitions. Word has length 58 [2019-10-02 14:57:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:36,599 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4043 transitions. [2019-10-02 14:57:36,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4043 transitions. [2019-10-02 14:57:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:57:36,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:36,601 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:36,601 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash -923442394, now seen corresponding path program 1 times [2019-10-02 14:57:36,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:36,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:36,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:36,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:36,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:36,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:36,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:36,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:36,649 INFO L87 Difference]: Start difference. First operand 2974 states and 4043 transitions. Second operand 3 states. [2019-10-02 14:57:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:37,789 INFO L93 Difference]: Finished difference Result 5652 states and 7797 transitions. [2019-10-02 14:57:37,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:37,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 14:57:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:37,793 INFO L225 Difference]: With dead ends: 5652 [2019-10-02 14:57:37,793 INFO L226 Difference]: Without dead ends: 4053 [2019-10-02 14:57:37,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states. [2019-10-02 14:57:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 2913. [2019-10-02 14:57:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2019-10-02 14:57:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3961 transitions. [2019-10-02 14:57:38,441 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3961 transitions. Word has length 60 [2019-10-02 14:57:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:38,442 INFO L475 AbstractCegarLoop]: Abstraction has 2913 states and 3961 transitions. [2019-10-02 14:57:38,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3961 transitions. [2019-10-02 14:57:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:57:38,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:38,443 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:38,444 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1191390895, now seen corresponding path program 1 times [2019-10-02 14:57:38,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:38,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:39,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:39,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 14:57:39,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:57:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:57:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:57:39,002 INFO L87 Difference]: Start difference. First operand 2913 states and 3961 transitions. Second operand 18 states. [2019-10-02 14:57:39,204 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2019-10-02 14:57:39,382 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-10-02 14:57:41,035 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-02 14:57:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:47,308 INFO L93 Difference]: Finished difference Result 10103 states and 14167 transitions. [2019-10-02 14:57:47,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:57:47,308 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-10-02 14:57:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:47,318 INFO L225 Difference]: With dead ends: 10103 [2019-10-02 14:57:47,319 INFO L226 Difference]: Without dead ends: 10099 [2019-10-02 14:57:47,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:57:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10099 states. [2019-10-02 14:57:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10099 to 2913. [2019-10-02 14:57:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2019-10-02 14:57:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3960 transitions. [2019-10-02 14:57:48,057 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3960 transitions. Word has length 60 [2019-10-02 14:57:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:48,057 INFO L475 AbstractCegarLoop]: Abstraction has 2913 states and 3960 transitions. [2019-10-02 14:57:48,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:57:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3960 transitions. [2019-10-02 14:57:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:57:48,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:48,059 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:48,059 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1883483238, now seen corresponding path program 1 times [2019-10-02 14:57:48,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:48,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:48,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:48,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:48,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:57:48,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:57:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:57:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:57:48,484 INFO L87 Difference]: Start difference. First operand 2913 states and 3960 transitions. Second operand 10 states. [2019-10-02 14:57:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:51,612 INFO L93 Difference]: Finished difference Result 7080 states and 9821 transitions. [2019-10-02 14:57:51,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:57:51,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-02 14:57:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:51,621 INFO L225 Difference]: With dead ends: 7080 [2019-10-02 14:57:51,622 INFO L226 Difference]: Without dead ends: 6491 [2019-10-02 14:57:51,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:57:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2019-10-02 14:57:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 2849. [2019-10-02 14:57:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2849 states. [2019-10-02 14:57:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3885 transitions. [2019-10-02 14:57:52,406 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3885 transitions. Word has length 60 [2019-10-02 14:57:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:52,408 INFO L475 AbstractCegarLoop]: Abstraction has 2849 states and 3885 transitions. [2019-10-02 14:57:52,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:57:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3885 transitions. [2019-10-02 14:57:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:57:52,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:52,411 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:52,411 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash 611531377, now seen corresponding path program 1 times [2019-10-02 14:57:52,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:52,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:52,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:52,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:52,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:53,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:53,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:57:53,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:57:53,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:57:53,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:57:53,095 INFO L87 Difference]: Start difference. First operand 2849 states and 3885 transitions. Second operand 19 states. [2019-10-02 14:57:53,358 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-10-02 14:57:53,776 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-10-02 14:57:54,010 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-10-02 14:57:55,701 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-02 14:57:56,045 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-02 14:57:56,252 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-02 14:58:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:03,398 INFO L93 Difference]: Finished difference Result 9001 states and 12625 transitions. [2019-10-02 14:58:03,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:58:03,399 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-02 14:58:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:03,408 INFO L225 Difference]: With dead ends: 9001 [2019-10-02 14:58:03,409 INFO L226 Difference]: Without dead ends: 8997 [2019-10-02 14:58:03,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:58:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8997 states. [2019-10-02 14:58:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8997 to 2861. [2019-10-02 14:58:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2861 states. [2019-10-02 14:58:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3902 transitions. [2019-10-02 14:58:04,246 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3902 transitions. Word has length 60 [2019-10-02 14:58:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:04,246 INFO L475 AbstractCegarLoop]: Abstraction has 2861 states and 3902 transitions. [2019-10-02 14:58:04,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:58:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3902 transitions. [2019-10-02 14:58:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:58:04,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:04,248 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:04,248 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1339672722, now seen corresponding path program 1 times [2019-10-02 14:58:04,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:04,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:04,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:04,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:04,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:04,304 INFO L87 Difference]: Start difference. First operand 2861 states and 3902 transitions. Second operand 3 states. [2019-10-02 14:58:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:05,601 INFO L93 Difference]: Finished difference Result 5457 states and 7548 transitions. [2019-10-02 14:58:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:05,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 14:58:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:05,605 INFO L225 Difference]: With dead ends: 5457 [2019-10-02 14:58:05,605 INFO L226 Difference]: Without dead ends: 3905 [2019-10-02 14:58:05,607 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2019-10-02 14:58:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 2769. [2019-10-02 14:58:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2769 states. [2019-10-02 14:58:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 3786 transitions. [2019-10-02 14:58:06,466 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 3786 transitions. Word has length 60 [2019-10-02 14:58:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:06,466 INFO L475 AbstractCegarLoop]: Abstraction has 2769 states and 3786 transitions. [2019-10-02 14:58:06,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 3786 transitions. [2019-10-02 14:58:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:58:06,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:06,468 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:06,468 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash 393961661, now seen corresponding path program 1 times [2019-10-02 14:58:06,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:06,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:06,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:06,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:06,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:07,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:07,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 14:58:07,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:58:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:58:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:58:07,146 INFO L87 Difference]: Start difference. First operand 2769 states and 3786 transitions. Second operand 15 states. [2019-10-02 14:58:07,727 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-02 14:58:07,986 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-02 14:58:08,216 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-02 14:58:08,502 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-02 14:58:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:13,845 INFO L93 Difference]: Finished difference Result 9382 states and 13107 transitions. [2019-10-02 14:58:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:58:13,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-10-02 14:58:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:13,855 INFO L225 Difference]: With dead ends: 9382 [2019-10-02 14:58:13,855 INFO L226 Difference]: Without dead ends: 9147 [2019-10-02 14:58:13,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:58:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9147 states. [2019-10-02 14:58:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9147 to 2760. [2019-10-02 14:58:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-10-02 14:58:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3774 transitions. [2019-10-02 14:58:14,833 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3774 transitions. Word has length 61 [2019-10-02 14:58:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:14,833 INFO L475 AbstractCegarLoop]: Abstraction has 2760 states and 3774 transitions. [2019-10-02 14:58:14,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:58:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3774 transitions. [2019-10-02 14:58:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:58:14,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:14,835 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:14,836 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:14,836 INFO L82 PathProgramCache]: Analyzing trace with hash 837436388, now seen corresponding path program 1 times [2019-10-02 14:58:14,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:14,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:14,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:14,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:14,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:14,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:58:14,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:58:14,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:58:14,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:58:14,920 INFO L87 Difference]: Start difference. First operand 2760 states and 3774 transitions. Second operand 6 states. [2019-10-02 14:58:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:18,724 INFO L93 Difference]: Finished difference Result 11328 states and 15876 transitions. [2019-10-02 14:58:18,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:58:18,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-02 14:58:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:18,732 INFO L225 Difference]: With dead ends: 11328 [2019-10-02 14:58:18,732 INFO L226 Difference]: Without dead ends: 9346 [2019-10-02 14:58:18,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:58:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9346 states. [2019-10-02 14:58:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9346 to 7178. [2019-10-02 14:58:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7178 states. [2019-10-02 14:58:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7178 states to 7178 states and 9824 transitions. [2019-10-02 14:58:21,329 INFO L78 Accepts]: Start accepts. Automaton has 7178 states and 9824 transitions. Word has length 67 [2019-10-02 14:58:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:21,330 INFO L475 AbstractCegarLoop]: Abstraction has 7178 states and 9824 transitions. [2019-10-02 14:58:21,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:58:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 7178 states and 9824 transitions. [2019-10-02 14:58:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:58:21,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:21,333 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:21,333 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:21,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2044258828, now seen corresponding path program 1 times [2019-10-02 14:58:21,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:21,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:21,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:21,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:58:21,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:58:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:58:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:21,451 INFO L87 Difference]: Start difference. First operand 7178 states and 9824 transitions. Second operand 5 states. [2019-10-02 14:58:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:24,051 INFO L93 Difference]: Finished difference Result 7184 states and 9827 transitions. [2019-10-02 14:58:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:58:24,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-02 14:58:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:24,058 INFO L225 Difference]: With dead ends: 7184 [2019-10-02 14:58:24,058 INFO L226 Difference]: Without dead ends: 6800 [2019-10-02 14:58:24,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2019-10-02 14:58:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 6796. [2019-10-02 14:58:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6796 states. [2019-10-02 14:58:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 9320 transitions. [2019-10-02 14:58:26,438 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 9320 transitions. Word has length 68 [2019-10-02 14:58:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:26,438 INFO L475 AbstractCegarLoop]: Abstraction has 6796 states and 9320 transitions. [2019-10-02 14:58:26,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:58:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 9320 transitions. [2019-10-02 14:58:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 14:58:26,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:26,441 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:26,441 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:26,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash -211315705, now seen corresponding path program 1 times [2019-10-02 14:58:26,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:26,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:26,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:26,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:26,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:26,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:26,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:58:26,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:58:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:58:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:58:26,534 INFO L87 Difference]: Start difference. First operand 6796 states and 9320 transitions. Second operand 6 states. [2019-10-02 14:58:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:31,709 INFO L93 Difference]: Finished difference Result 12492 states and 16975 transitions. [2019-10-02 14:58:31,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:58:31,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-10-02 14:58:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:31,723 INFO L225 Difference]: With dead ends: 12492 [2019-10-02 14:58:31,723 INFO L226 Difference]: Without dead ends: 12490 [2019-10-02 14:58:31,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:58:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12490 states. [2019-10-02 14:58:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12490 to 6961. [2019-10-02 14:58:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6961 states. [2019-10-02 14:58:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6961 states to 6961 states and 9430 transitions. [2019-10-02 14:58:34,459 INFO L78 Accepts]: Start accepts. Automaton has 6961 states and 9430 transitions. Word has length 69 [2019-10-02 14:58:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:34,459 INFO L475 AbstractCegarLoop]: Abstraction has 6961 states and 9430 transitions. [2019-10-02 14:58:34,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:58:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6961 states and 9430 transitions. [2019-10-02 14:58:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 14:58:34,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:34,463 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:34,463 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash -243529560, now seen corresponding path program 1 times [2019-10-02 14:58:34,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:34,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:34,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:34,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:34,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:34,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:34,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:34,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:34,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:34,523 INFO L87 Difference]: Start difference. First operand 6961 states and 9430 transitions. Second operand 3 states. [2019-10-02 14:58:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:39,223 INFO L93 Difference]: Finished difference Result 17995 states and 24475 transitions. [2019-10-02 14:58:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:39,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-02 14:58:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:39,236 INFO L225 Difference]: With dead ends: 17995 [2019-10-02 14:58:39,237 INFO L226 Difference]: Without dead ends: 11698 [2019-10-02 14:58:39,246 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11698 states. [2019-10-02 14:58:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11698 to 11551. [2019-10-02 14:58:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11551 states. [2019-10-02 14:58:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11551 states to 11551 states and 15429 transitions. [2019-10-02 14:58:43,837 INFO L78 Accepts]: Start accepts. Automaton has 11551 states and 15429 transitions. Word has length 70 [2019-10-02 14:58:43,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:43,838 INFO L475 AbstractCegarLoop]: Abstraction has 11551 states and 15429 transitions. [2019-10-02 14:58:43,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 11551 states and 15429 transitions. [2019-10-02 14:58:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 14:58:43,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:43,844 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:43,844 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash 113735652, now seen corresponding path program 1 times [2019-10-02 14:58:43,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:43,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:43,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:43,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:43,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:58:43,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:58:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:58:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:43,903 INFO L87 Difference]: Start difference. First operand 11551 states and 15429 transitions. Second operand 5 states. [2019-10-02 14:58:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:55,245 INFO L93 Difference]: Finished difference Result 35780 states and 48054 transitions. [2019-10-02 14:58:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:58:55,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-02 14:58:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:55,272 INFO L225 Difference]: With dead ends: 35780 [2019-10-02 14:58:55,272 INFO L226 Difference]: Without dead ends: 25025 [2019-10-02 14:58:55,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:58:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2019-10-02 14:59:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 14509. [2019-10-02 14:59:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14509 states. [2019-10-02 14:59:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14509 states to 14509 states and 19115 transitions. [2019-10-02 14:59:01,343 INFO L78 Accepts]: Start accepts. Automaton has 14509 states and 19115 transitions. Word has length 71 [2019-10-02 14:59:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:01,343 INFO L475 AbstractCegarLoop]: Abstraction has 14509 states and 19115 transitions. [2019-10-02 14:59:01,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:59:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 14509 states and 19115 transitions. [2019-10-02 14:59:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 14:59:01,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:01,348 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:01,349 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash -31702857, now seen corresponding path program 1 times [2019-10-02 14:59:01,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:01,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:01,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:01,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:01,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:01,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:01,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:01,409 INFO L87 Difference]: Start difference. First operand 14509 states and 19115 transitions. Second operand 3 states. [2019-10-02 14:59:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:12,898 INFO L93 Difference]: Finished difference Result 40555 states and 53527 transitions. [2019-10-02 14:59:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:59:12,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-02 14:59:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:12,927 INFO L225 Difference]: With dead ends: 40555 [2019-10-02 14:59:12,927 INFO L226 Difference]: Without dead ends: 26890 [2019-10-02 14:59:12,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-10-02 14:59:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 20637. [2019-10-02 14:59:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20637 states. [2019-10-02 14:59:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20637 states to 20637 states and 26919 transitions. [2019-10-02 14:59:22,156 INFO L78 Accepts]: Start accepts. Automaton has 20637 states and 26919 transitions. Word has length 72 [2019-10-02 14:59:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:22,156 INFO L475 AbstractCegarLoop]: Abstraction has 20637 states and 26919 transitions. [2019-10-02 14:59:22,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:59:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 20637 states and 26919 transitions. [2019-10-02 14:59:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 14:59:22,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:22,161 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:22,161 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1262178169, now seen corresponding path program 1 times [2019-10-02 14:59:22,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:22,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:22,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:22,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:22,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:22,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:22,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:22,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:22,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:22,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:22,214 INFO L87 Difference]: Start difference. First operand 20637 states and 26919 transitions. Second operand 3 states. [2019-10-02 14:59:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:38,738 INFO L93 Difference]: Finished difference Result 58142 states and 75485 transitions. [2019-10-02 14:59:38,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:59:38,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-02 14:59:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:38,782 INFO L225 Difference]: With dead ends: 58142 [2019-10-02 14:59:38,782 INFO L226 Difference]: Without dead ends: 38349 [2019-10-02 14:59:38,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38349 states. [2019-10-02 14:59:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38349 to 35452. [2019-10-02 14:59:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35452 states. [2019-10-02 14:59:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35452 states to 35452 states and 45546 transitions. [2019-10-02 14:59:54,807 INFO L78 Accepts]: Start accepts. Automaton has 35452 states and 45546 transitions. Word has length 74 [2019-10-02 14:59:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:54,807 INFO L475 AbstractCegarLoop]: Abstraction has 35452 states and 45546 transitions. [2019-10-02 14:59:54,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:59:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 35452 states and 45546 transitions. [2019-10-02 14:59:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 14:59:54,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:54,811 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:54,811 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash -617067464, now seen corresponding path program 1 times [2019-10-02 14:59:54,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:54,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:54,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:54,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:54,877 INFO L87 Difference]: Start difference. First operand 35452 states and 45546 transitions. Second operand 3 states. [2019-10-02 15:00:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:12,632 INFO L93 Difference]: Finished difference Result 75928 states and 97014 transitions. [2019-10-02 15:00:12,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:12,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-10-02 15:00:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:12,684 INFO L225 Difference]: With dead ends: 75928 [2019-10-02 15:00:12,684 INFO L226 Difference]: Without dead ends: 41081 [2019-10-02 15:00:12,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41081 states. [2019-10-02 15:00:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41081 to 39125. [2019-10-02 15:00:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39125 states. [2019-10-02 15:00:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39125 states to 39125 states and 49359 transitions. [2019-10-02 15:00:29,977 INFO L78 Accepts]: Start accepts. Automaton has 39125 states and 49359 transitions. Word has length 75 [2019-10-02 15:00:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:29,977 INFO L475 AbstractCegarLoop]: Abstraction has 39125 states and 49359 transitions. [2019-10-02 15:00:29,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 39125 states and 49359 transitions. [2019-10-02 15:00:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 15:00:29,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:29,985 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:29,985 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 59399319, now seen corresponding path program 1 times [2019-10-02 15:00:29,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:29,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:29,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 15:00:30,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:30,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:00:30,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:00:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:00:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:00:30,117 INFO L87 Difference]: Start difference. First operand 39125 states and 49359 transitions. Second operand 9 states. [2019-10-02 15:01:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:49,092 INFO L93 Difference]: Finished difference Result 183490 states and 231299 transitions. [2019-10-02 15:01:49,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 15:01:49,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-10-02 15:01:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:49,299 INFO L225 Difference]: With dead ends: 183490 [2019-10-02 15:01:49,299 INFO L226 Difference]: Without dead ends: 167488 [2019-10-02 15:01:49,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-10-02 15:01:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167488 states. [2019-10-02 15:02:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167488 to 39095. [2019-10-02 15:02:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39095 states. [2019-10-02 15:02:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39095 states to 39095 states and 49323 transitions. [2019-10-02 15:02:07,644 INFO L78 Accepts]: Start accepts. Automaton has 39095 states and 49323 transitions. Word has length 93 [2019-10-02 15:02:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:07,644 INFO L475 AbstractCegarLoop]: Abstraction has 39095 states and 49323 transitions. [2019-10-02 15:02:07,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:02:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 39095 states and 49323 transitions. [2019-10-02 15:02:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 15:02:07,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:07,651 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:07,651 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2071096031, now seen corresponding path program 1 times [2019-10-02 15:02:07,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:07,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:07,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:07,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:07,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:07,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 15:02:07,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:02:07,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:02:07,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:02:07,891 INFO L87 Difference]: Start difference. First operand 39095 states and 49323 transitions. Second operand 10 states. [2019-10-02 15:02:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:53,505 INFO L93 Difference]: Finished difference Result 117106 states and 146874 transitions. [2019-10-02 15:02:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 15:02:53,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-02 15:02:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:53,614 INFO L225 Difference]: With dead ends: 117106 [2019-10-02 15:02:53,614 INFO L226 Difference]: Without dead ends: 93970 [2019-10-02 15:02:53,646 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=723, Unknown=0, NotChecked=0, Total=992 [2019-10-02 15:02:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93970 states. [2019-10-02 15:03:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93970 to 52249. [2019-10-02 15:03:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52249 states. [2019-10-02 15:03:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52249 states to 52249 states and 65911 transitions. [2019-10-02 15:03:19,118 INFO L78 Accepts]: Start accepts. Automaton has 52249 states and 65911 transitions. Word has length 94 [2019-10-02 15:03:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:19,119 INFO L475 AbstractCegarLoop]: Abstraction has 52249 states and 65911 transitions. [2019-10-02 15:03:19,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 15:03:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 52249 states and 65911 transitions. [2019-10-02 15:03:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 15:03:19,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:19,127 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:03:19,127 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:19,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1782821772, now seen corresponding path program 1 times [2019-10-02 15:03:19,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:19,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:19,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:03:19,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:03:19,319 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:03:19,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:19,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 15:03:19,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:03:19,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:03:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:03:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:03:20,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:03:20,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-10-02 15:03:20,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 15:03:20,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 15:03:20,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-02 15:03:20,496 INFO L87 Difference]: Start difference. First operand 52249 states and 65911 transitions. Second operand 18 states. [2019-10-02 15:03:20,899 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-02 15:03:25,788 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-02 15:03:26,840 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-02 15:03:28,661 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-02 15:03:29,755 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-10-02 15:03:29,984 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-02 15:03:35,721 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-02 15:03:38,734 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-02 15:03:41,504 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 15:03:43,529 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-02 15:03:45,291 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-10-02 15:04:01,423 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-10-02 15:04:02,072 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-02 15:04:03,915 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 15:04:06,980 WARN L191 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-02 15:04:09,421 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-02 15:05:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:12,037 INFO L93 Difference]: Finished difference Result 225352 states and 281880 transitions. [2019-10-02 15:05:12,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-02 15:05:12,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2019-10-02 15:05:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:12,598 INFO L225 Difference]: With dead ends: 225352 [2019-10-02 15:05:12,598 INFO L226 Difference]: Without dead ends: 204464 [2019-10-02 15:05:12,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1664, Invalid=6168, Unknown=0, NotChecked=0, Total=7832 [2019-10-02 15:05:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204464 states. [2019-10-02 15:05:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204464 to 66971. [2019-10-02 15:05:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66971 states. [2019-10-02 15:05:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66971 states to 66971 states and 84525 transitions. [2019-10-02 15:05:48,951 INFO L78 Accepts]: Start accepts. Automaton has 66971 states and 84525 transitions. Word has length 94 [2019-10-02 15:05:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:48,951 INFO L475 AbstractCegarLoop]: Abstraction has 66971 states and 84525 transitions. [2019-10-02 15:05:48,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 15:05:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 66971 states and 84525 transitions. [2019-10-02 15:05:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 15:05:48,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:48,978 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:48,979 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2059708354, now seen corresponding path program 1 times [2019-10-02 15:05:48,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:48,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:48,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:48,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:48,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:49,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:05:49,137 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:05:49,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:49,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 15:05:49,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:05:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:49,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:05:49,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 15:05:49,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:05:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:05:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:05:49,448 INFO L87 Difference]: Start difference. First operand 66971 states and 84525 transitions. Second operand 6 states. [2019-10-02 15:06:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:50,284 INFO L93 Difference]: Finished difference Result 187749 states and 235764 transitions. [2019-10-02 15:06:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:06:50,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 15:06:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:50,514 INFO L225 Difference]: With dead ends: 187749 [2019-10-02 15:06:50,515 INFO L226 Difference]: Without dead ends: 121353 [2019-10-02 15:06:50,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:06:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121353 states. [2019-10-02 15:07:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121353 to 95995. [2019-10-02 15:07:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95995 states. [2019-10-02 15:07:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95995 states to 95995 states and 120947 transitions. [2019-10-02 15:07:37,017 INFO L78 Accepts]: Start accepts. Automaton has 95995 states and 120947 transitions. Word has length 95 [2019-10-02 15:07:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:37,018 INFO L475 AbstractCegarLoop]: Abstraction has 95995 states and 120947 transitions. [2019-10-02 15:07:37,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:07:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 95995 states and 120947 transitions. [2019-10-02 15:07:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 15:07:37,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:37,030 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:07:37,030 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:37,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1535026927, now seen corresponding path program 1 times [2019-10-02 15:07:37,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:37,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:07:37,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:07:37,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:07:37,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:07:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:07:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:07:37,136 INFO L87 Difference]: Start difference. First operand 95995 states and 120947 transitions. Second operand 5 states. [2019-10-02 15:08:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:08:36,789 INFO L93 Difference]: Finished difference Result 209581 states and 263326 transitions. [2019-10-02 15:08:36,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:08:36,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-02 15:08:36,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:08:36,934 INFO L225 Difference]: With dead ends: 209581 [2019-10-02 15:08:36,934 INFO L226 Difference]: Without dead ends: 114161 [2019-10-02 15:08:37,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:08:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114161 states. [2019-10-02 15:09:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114161 to 90325. [2019-10-02 15:09:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90325 states. [2019-10-02 15:09:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90325 states to 90325 states and 111876 transitions. [2019-10-02 15:09:21,512 INFO L78 Accepts]: Start accepts. Automaton has 90325 states and 111876 transitions. Word has length 96 [2019-10-02 15:09:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:21,512 INFO L475 AbstractCegarLoop]: Abstraction has 90325 states and 111876 transitions. [2019-10-02 15:09:21,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:09:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 90325 states and 111876 transitions. [2019-10-02 15:09:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 15:09:21,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:21,523 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:09:21,524 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1116081128, now seen corresponding path program 1 times [2019-10-02 15:09:21,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:21,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 15:09:21,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:21,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:09:21,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:09:21,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:09:21,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:09:21,674 INFO L87 Difference]: Start difference. First operand 90325 states and 111876 transitions. Second operand 5 states. [2019-10-02 15:10:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:12,742 INFO L93 Difference]: Finished difference Result 186672 states and 230690 transitions. [2019-10-02 15:10:12,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:10:12,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-02 15:10:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:12,883 INFO L225 Difference]: With dead ends: 186672 [2019-10-02 15:10:12,884 INFO L226 Difference]: Without dead ends: 96768 [2019-10-02 15:10:12,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:10:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96768 states.